Asymptotic normality of pattern counts in conjugacy classes

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.

Cited by in corpus (1)

• A geometric approach to conjugation-invariant random permutations