The order of large random permutations with cycle weights

DOI10.1214/EJP.V20-4331zbMATH Open1330.60019arXiv1505.04547MaRDI QIDQ907965FDOQ907965

Authors: Julia Storm, Dirk Zeindler 

Publication date: 2 February 2016

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Abstract: The order $O_n(sigma)$ of a permutation $sigma$ of $n$ objects is the smallest integer $kgeq1$ such that the $k$-th iterate of $sigma$ gives the identity. A remarkable result about the order of a uniformly chosen permutation is due to Erd"os and Tur'an who proved in 1965 that $log{O}_n$ satisfies a central limit theorem. We extend this result to the so-called extit{generalized Ewens measure} in a previous paper. In this paper, we establish a local limit theorem as well as, under some extra moment condition, a precise large deviations estimate. These properties are new even for the uniform measure. Furthermore, we provide precise large deviations estimates for random permutations with polynomial cycle weights.

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

Recommendations

• On the order of random permutation with cycle weights
• Cycle structure of random permutations with cycle weights
• The cycle structure of random permutations
• Random permutations with cycle weights
• Long cycle of random permutations with polynomially growing cycle weights
• On permutations with cycle lengths in a random set
• On the number of cycles in a random permutation
• Random permutations with logarithmic cycle weights
• Random permutations with cycle lengths in a given finite set

zbMATH Keywords

large deviationslocal limit theoremRiemann hypothesisrandom permutation[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Tur%EF%BF%BD%EF%BF%BDn+law&go=Go Erd��s-Tur��n law]generalised Ewens measureorder of a permutation

Mathematics Subject Classification ID

Functional limit theorems; invariance principles (60F17) Combinatorial probability (60C05) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15)

Cited In (5)

• Emergence of a giant component in a random permutation with given number of cycles
• Multiplicative arithmetic functions and the generalized Ewens measure
• Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
• On the order of random permutation with cycle weights
• A generalization of the Erdős-Turán law for the order of random permutation

This page was built for publication: The order of large random permutations with cycle weights

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