The number of cycles in random permutations without long cycles is asymptotically Gaussian

zbMath1371.60029arXiv1605.08383MaRDI QIDQ5346031

Helge Schäfer, Volker Betz

Publication date: 8 June 2017

Full work available at URL: https://arxiv.org/abs/1605.08383

zbMATH Keywords

central limit theoremrandom permutationtotal number of cyclescycle weights

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items

Recursive methods for some problems in coding and random permutations ⋮ Random permutations without macroscopic cycles ⋮ Precise asymptotics of longest cycles in random permutations without macroscopic cycles

Uses Software

• DLMF

Cites Work

• Unnamed Item
• Unnamed Item
• Local probabilities for random permutations without long cycles
• Permutations without long or short cycles
• On the number of cycles in a random permutation
• Random permutations with cycle weights
• Spatial random permutations and Poisson-Dirichlet law of cycle lengths
• Asymptotic analysis. Reprint
• Random permutations and Brownian motion
• The cycle structure of random permutations
• Asymptotic statistics of cycles in surrogate-spatial permutations
• Lattice permutations and Poisson-Dirichlet distribution of cycle lengths
• Random \(A\)-permutations: convergence to a Poisson process
• Random permutations of a regular lattice
• A functional central limit theorem for the Ewens sampling formula
• Limit Theorem for the General Number of Cycles in a Random A-Permutation
• Probabilistic Methods in Combinatorial Analysis
• On the field of combinatory analysis
• Ordered Cycle Lengths in a Random Permutation
• A problem of the Allocation of Particles in Cells and Cycles of Random Permutations

This page was built for publication: The number of cycles in random permutations without long cycles is asymptotically Gaussian