Cycles in Mallows random permutations

arxiv(2023)

引用 0|浏览1
暂无评分
摘要
We study cycle counts in permutations of 1,., n drawn at random according to the Mallows distribution. Under this distribution, each permutation pi is an element of S-n is selected with probability proportional to q(inv(pi)), where q > 0 is a parameter and inv(pi) denotes the number of inversions of pi. For l fixed, we study the vector (C-1 (Pi(n)),., C-l(Pi(n))) where C-i(pi) denotes the number of cycles of length i in pi and Pi(n) is sampled according to the Mallows distribution. When q = 1 the Mallows distribution simply samples a permutation of 1,., n 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 1, 1/2, 1/3,., 1/l. Here we show that if 0 < q < 1 is fixed and n -> infinity then there are positive constants m(i) such that each C-i(Pi(n)) has mean (1 + o(1)) center dot m(i) center dot n and the vector of cycle counts can be suitably rescaled to tend to a joint Gaussian distribution. Our results also show that when q > 1 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 n when q > 1. Both (C-1 (Pi(2n)), C-3(Pi(2n)),.) and (C-1(Pi(2n+1)), C-3(Pi(2n+1)),...) have discrete limiting distributions-they do not need to be renormalized-but the two limiting distributions are distinct for all q > 1. 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 q down arrow 1 the expected number of 1-cycles tends to 1/ 2-which, curiously, differs from the value corresponding to q = 1. In addition we exhibit an interesting "oscillating" behavior in the limiting probability measures for q > 1 and n odd versus n even.
更多
查看译文
关键词
random permutations,mallows distribution,cycle counts
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要