Abstract: We use Janson's dependency criterion to prove that the distribution of -descents of permutations of length converge to a normal distribution as goes to infinity. We show that this remains true even if is allowed to grow with , up to a certain degree.
Summary: We use Janson's dependency criterion to prove that the distribution of \(d\)-descents of permutations of length \(n\) converge to a normal distribution as \(n\) goes to infinity. We show that this remains true even if \(d\) is allowed to grow with \(n\).
Recommendations
- Convergence rates for generalized descents
- Central limit theorem for descents in conjugacy classes of \(S_n\)
- Normal approximations for descents and inversions of permutations of multisets
- The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
- Limit distribution of ascent, descent or excedance length sums of permutations
Cited in
(12)- Martingales and descent statistics
- Proper permutations, Schubert geometry, and randomness
- Normal approximations for descents and inversions of permutations of multisets
- Asymptotic normality of the generalized Eulerian numbers
- Descent Invariant and theSnCondition
- Asymptotic normality in t-stack sortable permutations
- 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
- Extreme values of permutation statistics
- Sharp large deviations and concentration inequalities for the number of descents in a random permutation
- Convergence rates for generalized descents
- Asymptotic independence in large random permutations with fixed descent set
This page was built for publication: Generalized descents and normality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010677)
