Random permutations with logarithmic cycle weights

DOI10.1214/19-AIHP1025MaRDI QIDQ2227473zbMATH OpenFDO

Authors Nicolas Robles, Dirk Zeindler

Publication date 15 February 2021

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1806.04700, https://projecteuclid.org/euclid.aihp/1593137316

zbMATH Keywords

functional central limit theoremTauberian theoremtotal variation distancelimit shapesingularity analysisrandom permutationscycle countstotal number of cycles

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Functional limit theorems; invariance principles (60F17) Combinatorial probability (60C05) Tauberian theorems (40E05)

Abstract: We consider random permutations on $Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables and also compute the total variation distance between both processes. Next, we prove a central limit theorem for the total number of cycles. Furthermore we establish a shape theorem and a functional central limit theorem for the Young diagrams associated to random permutations under this measure. We prove these results using tools from complex analysis and combinatorics. In particular we have to apply the method of singularity analysis to generating functions of the form $expleft((-log(1-z){)}^{k+1}ight)$ with $kgeq1$, which have not yet been studied in the literature.

Recommendations

• The limit shape of random permutations with polynomially growing cycle weights
• Long cycle of random permutations with polynomially growing cycle weights
• Total variation distance and the Erdős-Turán law for random permutations with polynomially growing cycle weights
• Cycle structure of random permutations with cycle weights
• The cycle structure of random permutations

Cites work

• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• A finite-interval uniqueness theorem for bilateral Laplace transforms
• A functional central limit theorem for the Ewens sampling formula
• Analytic combinatorics
• Asymptotic statistics of cycles in surrogate-spatial permutations
• Cycle length distributions in random permutations with diverging cycle weights
• Cycle structure of random permutations with cycle weights
• Limit Measures Arising in the Asympyotic Theory of Symmetric Groups. I.
• Logarithmic combinatorial structures: A probabilistic approach
• Polynomial partition asymptotics
• Random permutations with cycle weights
• Singularity analysis and asymptotics of Bernoulli sums
• The cycle structure of random permutations
• The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles
• The limit shape of random permutations with polynomially growing cycle weights
• The population structure associated with the Ewens sampling formula
• The sampling theory of neutral alleles and an urn model in population genetics
• The sampling theory of selectively neutral alleles
• Total variation distance and the Erdős-Turán law for random permutations with polynomially growing cycle weights

Cited in

(11)

• Long cycle of random permutations with polynomially growing cycle weights
• Limit shapes for Gibbs partitions of sets
• The Poisson distribution for linear statistics of random permutations
• The order of large random permutations with cycle weights
• Short cycles of random permutations with cycle weights: point processes approach
• The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles
• Multiplicative arithmetic functions and the generalized Ewens measure
• scientific article; zbMATH DE number 2127716 (Why is no real title available?)
• The limit shape of random permutations with polynomially growing cycle weights
• A Tale of Three Couplings: Poisson–Dirichlet and GEM Approximations for Random Permutations
• The cycle structure of random permutations

This page was built for publication: Random permutations with logarithmic cycle weights

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