Generalized Descents and Normality
Miklos Bona

TL;DR
This paper proves that the distribution of d-descents in permutations approaches a normal distribution as permutation size grows, even when the parameter d increases with n, using Janson's dependency criterion.
Contribution
It extends the normality result of d-descents to cases where d grows with n, broadening previous understanding of permutation statistics.
Findings
Distribution of d-descents converges to normal as n increases
Normality holds even when d grows with n up to a certain limit
Uses Janson's dependency criterion for proof
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · Bayesian Methods and Mixture Models
