Moments of permutation statistics and central limit theorems
From MaRDI portal
(Redirected from Publication:6153611)
Abstract: We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with constant coefficients. This generalizes a result of Zeilberger. We use an approach of Chern, Diaconis, Kane and Rhoades, previously applied on set partitions and matchings. In addition, we give a new proof of the central limit theorem (CLT) for the number of occurrences of classical patterns, which uses a lemma of Burstein and Hasto. We give a simple interpretation of this lemma and an analogous lemma that would imply the CLT for the number of occurrences of any vincular pattern. Furthermore, we obtain explicit formulas for the moments of the descents and the minimal descents statistics. The latter is used to give a new direct proof of the fact that we do not necessarily have asymptotic normality of the number of pattern occurrences in the case of bivincular patterns. Closed forms for some of the higher moments of several popular statistics on permutations are also obtained.
Recommendations
- A Central Limit Theorem for Vincular Permutation Patterns
- A central limit theorem for a new statistic on permutations
- On the asymptotic statistics of the number of occurrences of multiple permutation patterns
- Central limit theorems for patterns in multiset permutations and set partitions
- Central limit theorem for descents in conjugacy classes of \(S_n\)
Cites work
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A Central Limit Theorem for Vincular Permutation Patterns
- A formula for enumerating permutations with a fixed pinnacle set
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- An asymptotic distribution theory for Eulerian recurrences with applications
- Asymptotic behavior of some statistics in Ewens random permutations
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
- Central limit theorems for patterns in multiset permutations and set partitions
- Central limit theorems for some set partition statistics
- Closed expressions for averages of set partition statistics
- Combinatorics of permutations
- Consecutive patterns in permutations
- Eulerian Numbers
- Gaussian Hilbert Spaces
- Generalized permutation patterns and a classification of the Mahonian statistics
- Handbook of Enumerative Combinatorics
- scientific article; zbMATH DE number 2127712 (Why is no real title available?)
- scientific article; zbMATH DE number 50805 (Why is no real title available?)
- Moments of matching statistics
- Note on Runs of Consecutive Elements
- On a Test for Randomness Based on Signs of Differences
- On Stanley-Wilf limit of the pattern 1324
- Packing sets of patterns
- Pattern-avoiding Dyck paths
- Patterns in permutations and words.
- Patterns in random permutations
- Patterns in random permutations avoiding the pattern 132
- Patterns in random permutations avoiding the pattern 321
- Patterns in trees
- Some Probabilistic Aspects of Set Partitions
- Symbolic moment calculus. I: Foundations and permutation pattern statistics
- The Asymptotic Distribution of Runs of Consecutive Elements
- The Automatic Central Limit Theorems Generator (and Much More!)
- The generating function for total displacement
- The probability of avoiding consecutive patterns in the Mallows distribution
- Two moments suffice for Poisson approximations: The Chen-Stein method
This page was built for publication: Moments of permutation statistics and central limit theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153611)
