Poisson approximation for large permutation groups
Persi Diaconis, Nathan Tung

TL;DR
This paper studies the probabilistic behavior of large permutation groups formed by block permutations, deriving novel limit theorems showing that various permutation statistics converge to compound Poisson distributions with complex dependence.
Contribution
It introduces new limit theorems for permutation statistics in block permutation groups, revealing their convergence to compound Poisson distributions with dependence structures.
Findings
Limit theorems for fixed points and cycle counts
Convergence to compound Poisson distributions
Dependence structures in permutation statistics
Abstract
Let be a group of permutations of objects which permutes things independently in disjoint blocks of size and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of . This includes novel limit theorems for fixed points, cycles of various lengths, number of cycles and inversions. The limits are compound Poisson distributions with interesting dependence structure.
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
TopicsFinite Group Theory Research · Advanced Algebra and Geometry · Coding theory and cryptography
