Cycles in Mallows random permutations
Jimmy He, Tobias M\"uller, Teun Verstraaten

TL;DR
This paper analyzes cycle counts in Mallows permutations, revealing different asymptotic behaviors for even and odd cycles depending on the parameter q, with Gaussian limits for q<1 and discrete limits for q>1.
Contribution
It provides a detailed asymptotic analysis of cycle counts in Mallows permutations, including Gaussian limits for q<1 and novel discrete limit distributions for q>1, extending the understanding of permutation structures.
Findings
Cycle counts are asymptotically Gaussian for q<1.
Odd cycle counts exhibit discrete limiting distributions for q>1.
Expected number of 1-cycles tends to 1/2 as q approaches 1 from above.
Abstract
We study cycle counts in permutations of drawn at random according to the Mallows distribution. Under this distribution, each permutation is selected with probability proportional to , where is a parameter and denotes the number of inversions of . For fixed, we study the vector where denotes the number of cycles of length in and is sampled according to the Mallows distribution. Here we show that if is fixed and then there are positive constants such that each has mean and the vector of cycle counts can be suitably rescaled to tend to a joint Gaussian distribution. Our results also show that when there is striking difference between the behaviour of the even and the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Distribution Estimation and Applications · Statistical Methods and Bayesian Inference
