Central limit theorems for patterns in multiset permutations and set partitions

DOI10.1214/19-AAP1502zbMath1434.60040arXiv1811.03923MaRDI QIDQ2180386

Valentin Féray

Publication date: 13 May 2020

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.03923

zbMATH Keywords

central limit theoremset partitionspatternscombinatorial probabilitydependency graphsmultiset permutations

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Partitions of sets (05A18) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (7)

The method of cumulants for the normal approximation ⋮ A central limit theorem for descents of a Mallows permutation and its inverse ⋮ Asymptotic normality of consecutive patterns in permutations encoded by generating trees with one‐dimensional labels ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Asymptotic normality of pattern counts in conjugacy classes ⋮ On the asymptotic normality conditions for the number of repetitions in a stationary random sequence ⋮ Moments of permutation statistics and central limit theorems

Uses Software

• MahonianStat

Cites Work

• Unnamed Item
• Unnamed Item
• Closed expressions for averages of set partition statistics
• Asymptotic behavior of some statistics in Ewens random permutations
• Central limit theorems for some set partition statistics
• The Mahonian probability distribution on words is asymptotically normal
• A new method of normal approximation
• Generation of a random partition of a finite set by an urn model
• When are small subgraphs of a random graph normally distributed?
• Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs
• Engel's inequality for Bell numbers
• Weighted dependency graphs
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• The calculation of cumulants via conditioning
• Mod-ϕ Convergence
• On Three Different Notions of Monotone Subsequences
• On a Method of Calculation of Semi-Invariants
• Berry-Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing
• Hidden word statistics
• On a Theorem of Janson
• Orthogonal decompositions and functional limit theorems for random graph statistics
• A Central Limit Theorem for Vincular Permutation Patterns
• The probability of avoiding consecutive patterns in the Mallows distribution
• Probability Inequalities for Sums of Bounded Random Variables
• The Inversion Number and the Major Index are Asymptotically Jointly Normally Distributed on Words
• Probability and Computing
• Stirling Behavior is Asymptotically Normal
• The Number of Partitions of a Set
• A Class of Statistics with Asymptotically Normal Distribution
• Permutations of a multiset avoiding permutations of length 3

This page was built for publication: Central limit theorems for patterns in multiset permutations and set partitions