Random \(A\)-permutations: convergence to a Poisson process

DOI10.1134/S0001434607050318zbMath1134.60008OpenAlexW2008175913MaRDI QIDQ2473776

Arsen L. Yakymiv

Publication date: 4 March 2008

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434607050318

zbMATH Keywords

normal distributionpermutation groupPoisson processrandom permutationpermutation cycletotal variance distance

Mathematics Subject Classification ID

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

Related Items (4)

Random permutations without macroscopic cycles ⋮ Limit distributions for Euclidean random permutations ⋮ The number of cycles in random permutations without long cycles is asymptotically Gaussian ⋮ A limit theorem for the logarithm of the order of a random A-permutation

Cites Work

• Unnamed Item
• Unnamed Item
• On an equation in permutations
• The cycle structure of random permutations
• Limit Theorems for Combinatorial Structures via Discrete Process Approximations
• Asymptotic Methods in Enumeration
• Mappings of a Finite Set with Limitations on Contours and Height
• Random Mappings with Bounded Height
• Ordered Cycle Lengths in a Random Permutation
• A problem of the Allocation of Particles in Cells and Cycles of Random Permutations
• Regularly varying functions

This page was built for publication: Random \(A\)-permutations: convergence to a Poisson process