# A central limit theorem for a new statistic on permutations

@article{Chatterjee2016ACL,
title={A central limit theorem for a new statistic on permutations},
author={Sourav Chatterjee and Persi Diaconis},
journal={Indian Journal of Pure and Applied Mathematics},
year={2016},
volume={48},
pages={561-573}
}
• Published 4 August 2016
• Mathematics
• Indian Journal of Pure and Applied Mathematics
This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving central limit theorems more generally. It gives us an opportunity to acknowledge the work of our teacher and friend B. V. Rao.
31 Citations
Mathematics
• 2019
We study the asymptotic behaviour of the statistic (des+ ides)W which assigns to an element w of a finite Coxeter group W the number of descents of w plus the number of descents of w. Our main result
The purpose of this work is to establish a central limit theorem that can be applied to a particular form of Markov chains, including the number of descents in a random permutation of
L. Hofer
Mathematics
Discret. Math. Theor. Comput. Sci.
• 2017
It is shown that this statistics on uniform random permutations is asymptotically normal and described the speed of convergence and to prove this central limit theorem, the method of dependency graphs is used.
Mathematics
Electron. J. Comb.
• 2022
We study the asymptotic behaviour of the statistic $(\operatorname{des}+\operatorname{ides})_W$ which assigns to an element $w$ of a finite Coxeter group $W$ the number of descents of $w$ plus the
Mathematics
• 2022
. The goal of this paper is to go further in the analysis of the behavior of the number of descents in a random permutation. Via two diﬀerent approaches relying on a suitable martingale decomposition
In 2018, Kahle and Stump raised the following problem: identify sequences of finite Coxeter groups $W_n$ for which the two-sided descent statistics on a uniform random element of $W_n$ is
Jimmy He
Mathematics
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
• 2022
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
Mathematics
Statistics, Optimization & Information Computing
• 2021
In this paper, we obtain an explicit Berry-Esseen bound in the central limit theorem for nonlinear statistics with bounded differences. Some examples are provided as well.
This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was listed as an interesting direction by Chatterjee and Diaconis (2017).
We introduce a new version of Stein's method that reduces a large class of normal approximation problems to variance bounding exercises, thus making a connection between central limit theorems and
Let W be either the number of descents or inversions of a permutation. Stein's method is applied to show that W satisfies a central limit theorem with error rate n^(-1/2). The construction of an
Mathematics
Journal of Applied Probability
• 1996
We consider the exact distribution of the number of peaks in a random permutation of the integers 1, 2, ···, n. This arises from a test of whether n successive observations from a continuous
Mathematics
• 2009
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent
Given a permutationchosen uniformly from Sn, the joint distribution of �(1) and the number of descents in � is explored and generating functions are derived, showing that it is unimodal if viewed correctly and when d is small the distribution among the permutations with d descents is approximately geometric.
Mathematics
• 2010
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in
This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations.
Mathematics
• 2004
We establish both uniform and nonuniform error bounds of the Berry–Esseen type in normal approximation under local dependence. These results are of an order close to the best possible if not best
The Weil conjectures are applied to the Hessenberg varieties to obtain information about the combinatorics of descents in the symmetric group and elementary linear algebra leads to elegant proofs of some identities from the theory ofdescents.