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

DOI10.1214/21-AIHP1167zbMATH Open1500.60003arXiv2005.09802OpenAlexW3027973516WikidataQ113752005 ScholiaQ113752005MaRDI QIDQ2155509FDOQ2155509

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)

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.

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

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\)

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)

Cites Work

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

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
• Convergence rate for the number of crossings in a random labelled tree
• A central limit theorem for descents and major indices in fixed conjugacy classes of \(S_n\)
• 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)