Abstract:
Suppose that SnSn is the permutation group of degree nn, AA is a subset of the set of natural numbers N, and Tn=Tn(A) is the set of all permutations from Sn whose cycle lengths belong to the set A. Permutations from Tn are usually called A-permutations. We consider a wide class of sets A of positive asymptotic density. Suppose that ζmn is the number of cycles of length m of a random permutation uniformly distributed on Tn. It is shown in this paper that the finite-dimensional distributions of the random process {ζmn,m∈A} weakly converge as n→∞ to the finite-dimensional distributions of a Poisson process on A.
Keywords:
random permutation, Poisson process, permutation group, permutation cycle, total variance distance, normal distribution.
This publication is cited in the following 7 articles:
Dor Elboim, Ofir Gorodetsky, “Multiplicative arithmetic functions and the generalized Ewens measure”, Isr. J. Math., 2024
Betz V., Schaefer H., Zeindler D., “Random Permutations Without Macroscopic Cycles”, Ann. Appl. Probab., 30:3 (2020), 1484–1505
Elboim D., Peled R., “Limit Distributions For Euclidean Random Permutations”, Commun. Math. Phys., 369:2 (2019), 457–522
Betz V., Schaefer H., “The Number of Cycles in Random Permutations Without Long Cycles Is Asymptotically Gaussian”, ALEA-Latin Am. J. Probab. Math. Stat., 14:1 (2017), 427–444
A. L. Yakymiv, “A limit theorem for the logarithm of the order of a random A-permutation”, Discrete Math. Appl., 20:3 (2010), 247–275
Benaych-Georges F., “Cycles of Free Words in Several Independent Random Permutations with Restricted Cycle Lengths”, Indiana Univ. Math. J., 59:5 (2010), 1547–1586
A. L. Yakymiv, “Limit Theorem for the Middle Members of Ordered Cycle Lengths in Random A-Permutations”, Theory Probab. Appl., 54:1 (2010), 114–128