Long cycle of random permutations with polynomially growing cycle weights
Probability
2020-02-04 v2
Abstract
We study the asymptotic behavior of the long cycles of a random permutation of objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the longest cycles converge, after suitable normalisation, in distribution to iid random variables such that is exponentially distributed. Our method is based on generating functions and the saddle point method.
Cite
@article{arxiv.1911.06649,
title = {Long cycle of random permutations with polynomially growing cycle weights},
author = {Dirk Zeindler},
journal= {arXiv preprint arXiv:1911.06649},
year = {2020}
}
Comments
12 pages