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

DOI10.1214/21-AIHP1167zbMath1500.60003arXiv2005.09802OpenAlexW3027973516WikidataQ113752005 ScholiaQ113752005MaRDI QIDQ2155509

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

Stein's methodcentral limit theoremdescentsMallows permutations

Mathematics Subject Classification ID

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

Related Items

Convergence rate for the number of crossings in a random labelled tree

Cites Work

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