Asymptotic normality of pattern counts in conjugacy classes
Preprint
Abstract
We prove, under mild conditions on fixed points and two cycles, the asymptotic normality of vincular pattern counts for a permutation chosen uniformly at random in a conjugacy class.Additionally, we prove that the limiting variance is always non-degenerate for classical pattern counts. The proof uses weighted dependency graphs.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A geometric approach to conjugation-invariant random permutationsProbability Theory and Related Fields, 2025
- Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutationsAdvances in Applied Probability, 2023
- Universality for random permutations and some other groupsStochastic Processes and their Applications, 2022
- Central Limit Theorem for Peaks of a Random Permutation in a Fixed Conjugacy Class of $S_n$Annals of Combinatorics, 2021
- Central limit theorems for patterns in multiset permutations and set partitionsThe Annals of Applied Probability, 2020
- Central limit theorem for descents in conjugacy classes of SJournal of Combinatorial Theory, Series A, 2020
- Weighted dependency graphsElectronic Journal of Probability, 2018
- Combinatorics of the Three-Parameter PASEP Partition FunctionThe Electronic Journal of Combinatorics, 2011
- A Probabilistic Approach to the Asymptotics of the Length of the Longest Alternating SubsequenceThe Electronic Journal of Combinatorics, 2010
- The Distribution of Descents in Fixed Conjugacy Classes of the Symmetric GroupsJournal of Combinatorial Theory, Series A, 1998