Summary: \(d\)-descents are permutation statistics that generalize the notions of descents and inversions. It is known that the distribution of \(d\)-descents of permutations of length \(n\) satisfies a central limit theorem as \(n\) goes to infinity. We provide an explicit formula for the mean and variance of these statistics and obtain bounds on the rate of convergence using Stein's method.
Recommendations
Cited in
(12)- Generalized descents and normality
- Asymptotic results on weakly increasing subsequences in random words
- Martingales and descent statistics
- On bounded deviated permutations and their leading statistics
- Descent-inversion statistics in riffle shuffles
- A central limit theorem for the number of descents and some urn models
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations
- Central limit theorems for generalized descents and generalized inversions in finite root systems
- Sharp large deviations and concentration inequalities for the number of descents in a random permutation
- Discretized normal approximation for the number of descents
- Joint extremes of inversions and descents of random permutations
- On unfair permutations
This page was built for publication: Convergence rates for generalized descents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665758)
