Poisson approximation for large permutation groups
Abstract
Let Gk,n be a group of permutations of kn objects which permutes things independently in disjoint blocks of size k and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of Gk,n. 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.