Fetching the paper…

Reading the bibliography…

2007

The copies of any permutation pattern are asymptotically normal

Bona, Miklos

Original
PDF
Post on X

Understand

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

The copies of any permutation pattern are asymptotically normal · Around

Built on

S. Janson, Normal convergence by higher semi-invariants with applications to sums of dependent random variables and random graphs. Ann. Prob
1988
Earlier work this paper cites.

Similar

J. Fulman, Stein’s Method and Non-reversible Markov Chains. Stein’s method: expository lectures and applications, 69–77, IMS Lecture Notes Monogr. Ser., 46, Inst. Math. Statist., Beachwood, OH, 2004
2004
Cited alongside, same era.
M. Bóna, Generalized Descents and Normality, submitted
Cited in the paper.
M. Bóna, On Three Notions of Monotone Subsequences, submitted
Cited in the paper.

Then

Nothing clear enough to list yet.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…