$L^p$ bounds for a central limit theorem with involutions
Subhankar Ghosh

TL;DR
This paper establishes $L^p$ bounds for a central limit theorem involving involutions, extending classical results for permutations by employing Stein's method and zero bias transformations.
Contribution
It introduces new $L^p$ bounds for sums over involutions, extending prior CLT bounds from permutations to involutions using Stein's method and zero bias techniques.
Findings
Derived $L^p$ bounds for involution-based sums
Extended classical permutation CLT bounds to involutions
Utilized Stein's method and zero bias transformations
Abstract
Let be a fixed array of real numbers such that for . Let the permutation group be denoted by and the collection of involutions with no fixed points by , that is, with id denoting the identity permutation. For uniformly chosen from , let and where and . Denoting by and the distribution functions of and a variate respectively, we bound for using Stein's method and the zero bias transformation. Optimal Berry-Esseen or bounds for the classical problem where is chosen uniformly from were obtained by Bolthausen using Stein's method. Although in our case…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Analytic Number Theory Research · Limits and Structures in Graph Theory
