The number of cycles in random permutations without long cycles is asymptotically Gaussian
classification
🧮 math.PR
keywords
cyclesasymptoticlongnumberpermutationsrandomadditionalallowed
read the original abstract
For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we derive asymptotic expansions for the corresponding expected value and variance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.