A Central Limit Theorem for Vincular Permutation Patterns
From MaRDI portal
Abstract: We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem, we use the method of dependency graphs. The main difficulty is then to estimate the variance of our statistics. We need a lower bound on the variance, for which we introduce a recursive technique based on the law of total variance.
Recommendations
- A central limit theorem for a new statistic on permutations
- Central limit theorems for patterns in multiset permutations and set partitions
- A central limit theorem for descents of a Mallows permutation and its inverse
- A note on applications of the martingale central limit theorem to random permutations
- scientific article; zbMATH DE number 714511
- Central limit theorem for peaks of a random permutation in a fixed conjugacy class of \(S_n\)
- Distributions of statistics over pattern-avoiding permutations
- scientific article; zbMATH DE number 540513
- A central limit theorem for integer partitions
Cited in
(17)- Error bound in a central limit theorem of double-indexed permutation statistics
- A central limit theorem for a new statistic on permutations
- The volume of simplices in high-dimensional Poisson-Delaunay tessellations
- Universality for random permutations and some other groups
- The method of cumulants for the normal approximation
- Central limit theorems for patterns in multiset permutations and set partitions
- On the asymptotic statistics of the number of occurrences of multiple permutation patterns
- Patterns in random permutations
- Matchings up to permutations in sequences of independent trials
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations
- Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels
- Asymptotic normality of pattern counts in conjugacy classes
- Moments of permutation statistics and central limit theorems
- Thresholds for patterns in random permutations with a given number of inversions
- A geometric approach to conjugation-invariant random permutations
- How balanced can permutations be?
- Counting occurrences of patterns in permutations
This page was built for publication: A Central Limit Theorem for Vincular Permutation Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560192)
