Precise asymptotics of longest cycles in random permutations without macroscopic cycles

DOI10.3150/20-BEJ1282MaRDI QIDQ2040076zbMATH OpenOpenAlexFDO

Authors Volker Betz, Julian Mühlbauer, Helge Schäfer, Dirk Zeindler

Publication date 9 July 2021

Published in Bernoulli (Search for Journal in Brave)

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

zbMATH Keywords

cycle structureEwens measurefunctional limit theoremlong cyclesrandom permutationstotal variation distance

Mathematics Subject Classification ID

Combinatorial probability (60C05) Functional limit theorems; invariance principles (60F17)

Abstract: We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $$ with $$ and to study the asymptotic behaviour as $noinfty$. We obtain very precise information on the joint distribution of the lengths of the longest cycles; in particular we prove a functional limit theorem where the cumulative number of long cycles converges to a Poisson process in the suitable scaling. Furthermore, we prove convergence of the total variation distance between joint cycle counts and suitable independent Poisson random variables up to a significantly larger maximal cycle length than previously known. Finally, we remove a superfluous assumption from a central limit theorem for the total number of cycles proved in an earlier paper.

Review text

This paper presents precise asymptotics of longest cycles in random Ewens permutations without macroscopic cycles. The permutations that completely disallow some cycle lengths are the focus of this paper. On the basis of generating functions and the saddle point method, precise asymptotic expressions for the distribution of the longest cycles in different regimes are obtained. The number of cycles of length \(\alpha(n)\) is considered and some limit cases are examined. Here, \(n^{a_1}<\alpha(n)<n^{a_2}\), where \(a_1, a_2\in(0,1)\). By considering Poisson random variables with expectation related to \(n\), the validity of the joint Poisson approximation is generalized to the entire regime of cycles of length \(o(\alpha(n))\).

Recommendations

• The cycle structure of random permutations without macroscopic cycles
• Random permutations without macroscopic cycles
• The number of cycles in random permutations without long cycles is asymptotically Gaussian
• Profiles of permutations
• The cycle structure of random permutations

Cites work

• A generalization of the Curtiss theorem for moment generating functions
• A limit theorem for the logarithm of the order of a random A-permutation
• Analytic combinatorics
• Asymptotic statistics of cycles in surrogate-spatial permutations
• Cycle structure of random permutations with cycle weights
• Feynman cycles in the Bose gas
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
• Limit distributions for Euclidean random permutations
• Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
• Limit theorem for the middle members of ordered cycle lengths in random A-permutations
• Local probabilities for random permutations without long cycles
• Logarithmic combinatorial structures: A probabilistic approach
• Random permutations and Brownian motion
• Random permutations with cycle weights
• Random permutations without macroscopic cycles
• Site monotonicity and uniform positivity for interacting random walks and the spin \(O(N)\) model with arbitrary \(N\)
• Spatial random permutations and infinite cycles
• Spatial random permutations and Poisson-Dirichlet law of cycle lengths
• The cycle structure of random permutations
• The cycle structure of random permutations without macroscopic cycles
• The number of cycles in random permutations without long cycles is asymptotically Gaussian
• The population structure associated with the Ewens sampling formula
• The sampling theory of selectively neutral alleles

Cited in

(3)

• Random permutations without macroscopic cycles
• The cycle structure of random permutations without macroscopic cycles
• The number of cycles in random permutations without long cycles is asymptotically Gaussian

This page was built for publication: Precise asymptotics of longest cycles in random permutations without macroscopic cycles

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