On the cycle structure of Mallows permutations

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation ..Sn is proportional to qinv(.) where q>0 and inv(.) is the number of inversions inx. We focus on the case that q<1 and show that the expected length of the cycle containing a given point is of order min{(1.q).2,n}. This marks the existence of two asymptotic regimes: with high probability, when n tends to infinity with (1.q).2.n then all cycles have size o(n) whereas when n tends to infinity with (1.q).2.n then macroscopic cycles, of size proportional to n , emerge. In the second regime, we prove that the distribution of normalized cycle lengths follows the Poisson.Dirichlet law, as in a uniformly random permutation. The results bear formal similarity with a conjectured localization transition for random band matrices. Further results are presented for the variance of the cycle lengths, the expected diameter of cycles and the expected number of cycles. The proofs rely on the exact sampling algorithm for the Mallows distribution and make use of a special diagonal exposure process for the graph of the permutation.