TY - JOUR
T1 - Cycles in Mallows random permutations
AU - He, Jimmy
AU - Müller, Tobias
AU - Verstraaten, Teun W.
N1 - Publisher Copyright:
© 2023 The Authors. Random Structures & Algorithms published by Wiley Periodicals LLC.
PY - 2023/12
Y1 - 2023/12
N2 - We study cycle counts in permutations of (Formula presented.) drawn at random according to the Mallows distribution. Under this distribution, each permutation (Formula presented.) is selected with probability proportional to (Formula presented.), where (Formula presented.) is a parameter and (Formula presented.) denotes the number of inversions of (Formula presented.). For (Formula presented.) fixed, we study the vector (Formula presented.) where (Formula presented.) denotes the number of cycles of length (Formula presented.) in (Formula presented.) and (Formula presented.) is sampled according to the Mallows distribution. When (Formula presented.) the Mallows distribution simply samples a permutation of (Formula presented.) uniformly at random. A classical result going back to Kolchin and Goncharoff states that in this case, the vector of cycle counts tends in distribution to a vector of independent Poisson random variables, with means (Formula presented.). Here we show that if (Formula presented.) is fixed and (Formula presented.) then there are positive constants (Formula presented.) such that each (Formula presented.) has mean (Formula presented.) and the vector of cycle counts can be suitably rescaled to tend to a joint Gaussian distribution. Our results also show that when (Formula presented.) there is a striking difference between the behavior of the even and the odd cycles. The even cycle counts still have linear means, and when properly rescaled tend to a multivariate Gaussian distribution. For the odd cycle counts on the other hand, the limiting behavior depends on the parity of (Formula presented.) when (Formula presented.). Both (Formula presented.) and (Formula presented.) have discrete limiting distributions—they do not need to be renormalized—but the two limiting distributions are distinct for all (Formula presented.). We describe these limiting distributions in terms of Gnedin and Olshanski's bi-infinite extension of the Mallows model. We investigate these limiting distributions further, and study the behavior of the constants involved in the Gaussian limit laws. We for example show that as (Formula presented.) the expected number of 1-cycles tends to (Formula presented.) —which, curiously, differs from the value corresponding to (Formula presented.). In addition we exhibit an interesting “oscillating” behavior in the limiting probability measures for (Formula presented.) and (Formula presented.) odd versus (Formula presented.) even.
AB - We study cycle counts in permutations of (Formula presented.) drawn at random according to the Mallows distribution. Under this distribution, each permutation (Formula presented.) is selected with probability proportional to (Formula presented.), where (Formula presented.) is a parameter and (Formula presented.) denotes the number of inversions of (Formula presented.). For (Formula presented.) fixed, we study the vector (Formula presented.) where (Formula presented.) denotes the number of cycles of length (Formula presented.) in (Formula presented.) and (Formula presented.) is sampled according to the Mallows distribution. When (Formula presented.) the Mallows distribution simply samples a permutation of (Formula presented.) uniformly at random. A classical result going back to Kolchin and Goncharoff states that in this case, the vector of cycle counts tends in distribution to a vector of independent Poisson random variables, with means (Formula presented.). Here we show that if (Formula presented.) is fixed and (Formula presented.) then there are positive constants (Formula presented.) such that each (Formula presented.) has mean (Formula presented.) and the vector of cycle counts can be suitably rescaled to tend to a joint Gaussian distribution. Our results also show that when (Formula presented.) there is a striking difference between the behavior of the even and the odd cycles. The even cycle counts still have linear means, and when properly rescaled tend to a multivariate Gaussian distribution. For the odd cycle counts on the other hand, the limiting behavior depends on the parity of (Formula presented.) when (Formula presented.). Both (Formula presented.) and (Formula presented.) have discrete limiting distributions—they do not need to be renormalized—but the two limiting distributions are distinct for all (Formula presented.). We describe these limiting distributions in terms of Gnedin and Olshanski's bi-infinite extension of the Mallows model. We investigate these limiting distributions further, and study the behavior of the constants involved in the Gaussian limit laws. We for example show that as (Formula presented.) the expected number of 1-cycles tends to (Formula presented.) —which, curiously, differs from the value corresponding to (Formula presented.). In addition we exhibit an interesting “oscillating” behavior in the limiting probability measures for (Formula presented.) and (Formula presented.) odd versus (Formula presented.) even.
KW - cycle counts
KW - mallows distribution
KW - random permutations
UR - http://www.scopus.com/inward/record.url?scp=85162996579&partnerID=8YFLogxK
U2 - 10.1002/rsa.21169
DO - 10.1002/rsa.21169
M3 - Article
AN - SCOPUS:85162996579
SN - 1042-9832
VL - 63
SP - 1054
EP - 1099
JO - Random Structures and Algorithms
JF - Random Structures and Algorithms
IS - 4
ER -