A central limit theorem for descents of a Mallows permutation and its inverse

DOI10.1214/21-AIHP1167MaRDI QIDQ2155509zbMATH OpenOpenAlexWikidataFDO

Authors Jimmy He

Publication date 15 July 2022

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/2005.09802

zbMATH Keywords

central limit theoremStein's methoddescentsMallows permutations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Probability measures on groups or semigroups, Fourier transforms, factorization (60B15) Combinatorial aspects of groups and algebras (05E16)

Abstract: This paper studies the asymptotic distribution of descents $des(w)$ in a permutation $w$, and its inverse, distributed according to the Mallows measure. The Mallows measure is a non-uniform probability measure on permutations introduced to study ranked data. Under this measure, permutations are weighted according to the number of inversions they contain, with the weighting controlled by a parameter $q$. The main results are a Berry-Esseen theorem for $des(w)+des(w^{-1})$ as well as a joint central limit theorem for $(des(w),des(w^{-1}))$ to a bivariate normal with a non-trivial correlation depending on $q$. The proof uses Stein's method with size-bias coupling along with a regenerative process associated to the Mallows measure.

Recommendations

• Limit theorems for longest monotone subsequences in random Mallows permutations
• The limit of the empirical measure of the product of two independent Mallows permutations
• Cycles in Mallows random permutations
• The length of the longest increasing subsequence of a random Mallows permutation
• Central limit theorem for descents in conjugacy classes of \(S_n\)

Cites work

• scientific article; zbMATH DE number 4155658 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• A central limit theorem for a new statistic on permutations
• A central limit theorem for descents and major indices in fixed conjugacy classes of \(S_n\)
• A central limit theorem for the two-sided descent statistic on Coxeter groups
• A survey of consecutive patterns in permutations
• Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
• Arcsine laws for random walks generated from random permutations with applications to genomics
• Asymptotics of a locally dependent statistic on finite reflection groups
• Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
• Central limit theorem for descents in conjugacy classes of \(S_n\)
• Central limit theorems for patterns in multiset permutations and set partitions
• Combinatorics of Coxeter Groups
• Counting inversions and descents of random elements in finite Coxeter groups
• Cutoff phenomenon for the asymmetric simple exclusion process and the biased card shuffling
• Estimation in exponential families on permutations
• Fixed points and cycle structure of random permutations
• Fundamentals of Stein's method
• Lengths of monotone subsequences in a Mallows permutation
• Limit theorems for longest monotone subsequences in random Mallows permutations
• Mallows permutations and finite dependence
• Mallows permutations as stable matchings
• Multivariate normal approximations by Stein's method and size bias couplings
• NON-NULL RANKING MODELS. I
• Normal approximations for descents and inversions of permutations of multisets
• On adding a list of numbers (and other one-dependent determinantal processes)
• On the central limit theorem for the two-sided descent statistics in Coxeter groups
• On the cycle structure of Mallows permutations
• On the joint distribution of descents and signs of permutations
• Pattern avoidance for random permutations
• Regenerative random permutations of integers
• Size biased couplings and the spectral gap for random regular graphs
• Stochastic processes. Theory for applications.
• The distribution of descents in fixed conjugacy classes of the symmetric groups
• The length of the longest increasing subsequence of a random Mallows permutation
• The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
• The probability of avoiding consecutive patterns in the Mallows distribution
• The two-sided infinite extension of the Mallows model for random permutations
• Weighted dependency graphs
• q-exchangeability via quasi-invariance

Cited in

(14)

• The limit of the empirical measure of the product of two independent Mallows permutations
• Limit theorems for longest monotone subsequences in random Mallows permutations
• Martingales and descent statistics
• On the cycle structure of Mallows permutations
• Comparing the inversion statistic for distribution-biased and distribution-shifted permutations with the geometric and the GEM distributions
• Limits of Mallows trees
• Extreme values of permutation statistics
• A Central Limit Theorem for Vincular Permutation Patterns
• Thresholds for patterns in random permutations with a given number of inversions
• A central limit theorem for descents and major indices in fixed conjugacy classes of \(S_n\)
• Convergence rate for the number of crossings in a random labelled tree
• Normal approximations for descents and inversions of permutations of multisets
• A central limit theorem for a new statistic on permutations
• Convergence rates for generalized descents

This page was built for publication: A central limit theorem for descents of a Mallows permutation and its inverse

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