The copies of any permutation pattern are asymptotically normal

Abstract

We prove that the number of copies of any given permutation pattern $q$ has an asymptotically normal distribution in random permutations.

8 pages

Cited by in corpus (9)

• Patterns in random permutations avoiding the pattern 132
• Counting Small Permutation Patterns
• On meteors, earthworms and WIMPs
• Reduced word enumeration, complexity, and randomization
• Renewal theory for asymmetric $U$-statistics
• Concentration inequalities in spaces of random configurations with positive Ricci curvatures
• The Four Point Permutation Test for Latent Block Structure in Incidence Matrices
• Asymptotic normality for $m$-dependent and constrained $U$-statistics, with applications to pattern matching in random strings and permutations
• Moments of permutation statistics and central limit theorems