A central limit theorem for cycles of Mallows permutations

MaRDI QIDQ6386039zbMATH OpenFDO

Authors Jimmy He

Publication date 17 December 2021

Mathematics Subject Classification ID

Combinatorial aspects of groups and algebras (05E16) Symmetric groups (20B30) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Central limit and other weak theorems (60F05)

Abstract: Fix $qeq1$, and sample $win{S}_n$ from the Mallows measure. We study the distribution of $C_i(w)$, the number of $i$-cycles, as $n$ grows large. When $q<1$, they are jointly Gaussian, and this more or less follows from known ideas, but the regime $q>1$ behaves quite differently. In particular, we show that the even cycles $C_{2i}(w)$ have a mean and variance of order $n$, and jointly converge to Gaussian random variables, while the odd cycles $C_{2i+1}(w)$ have a bounded mean and variance, and converge to $C_{2i+1}(w^{even})$ or $C_{2i+1}(w^{odd})$ for some explicit random permutations $w^{even}$ and $w^{odd}$, depending on whether $n$ is even or odd. An extension to a larger class of functions is also given. The proof utilizes a two-sided stationary regenerative process associated to Mallows permutations constructed by Gnedin and Olshanski, extending the ideas of Basu and Bhatnagar.

This page was built for publication: A central limit theorem for cycles of Mallows permutations

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