On the cycle structure of Mallows permutations

From MaRDI portal
Publication:1746151

DOI10.1214/17-AOP1202zbMATH Open1430.60015arXiv1601.06991OpenAlexW2963697835WikidataQ130185189 ScholiaQ130185189MaRDI QIDQ1746151FDOQ1746151


Authors: Alexey Gladkich, Ron Peled Edit this on Wikidata


Publication date: 24 April 2018

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation piinmathbbSn is proportional to qextrminv(pi) where 0<qle1 and extrminv(pi) is the number of inversions in pi. We show that the expected length of the cycle containing a given point is of order min(1q)2,n. This marks the existence of two asymptotic regimes: with high probability, when n tends to infinity with (1q)2lln then all cycles have size o(n) whereas when n tends to infinity with (1q)2ggn 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.


Full work available at URL: https://arxiv.org/abs/1601.06991




Recommendations




Cites Work


Cited In (24)





This page was built for publication: On the cycle structure of Mallows permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746151)