Geodesic
A Central Limit Theorem for Vincular Permutation Patterns
Discrete mathematics & theoretical computer science, Permutation Patterns 2016, Tome 19 (2017-2018) no. 2

Voir la notice de l'article provenant de la source Episciences

We study the number of occurrences of any fixed vincular permutation pattern. We show that this statistics on uniform random permutations is asymptotically normal and describe the speed of convergence. To prove this central limit theorem, we use the method of dependency graphs. The main difficulty is then to estimate the variance of our statistics. We need a lower bound on the variance, for which we introduce a recursive technique based on the law of total variance. 
@article{DMTCS_2018_19_2_a7,
     author = {Hofer, Lisa},
     title = {A {Central} {Limit} {Theorem} for {Vincular} {Permutation} {Patterns}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2017-2018},
     doi = {10.23638/DMTCS-19-2-9},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-2-9/}
}
TY  - JOUR
AU  - Hofer, Lisa
TI  - A Central Limit Theorem for Vincular Permutation Patterns
JO  - Discrete mathematics & theoretical computer science
PY  - 2017-2018
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-2-9/
DO  - 10.23638/DMTCS-19-2-9
LA  - en
ID  - DMTCS_2018_19_2_a7
ER  - 
%0 Journal Article
%A Hofer, Lisa
%T A Central Limit Theorem for Vincular Permutation Patterns
%J Discrete mathematics & theoretical computer science
%D 2017-2018
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.23638/DMTCS-19-2-9/
%R 10.23638/DMTCS-19-2-9
%G en
%F DMTCS_2018_19_2_a7
Hofer, Lisa. A Central Limit Theorem for Vincular Permutation Patterns. Discrete mathematics & theoretical computer science, Permutation Patterns 2016, Tome 19 (2017-2018) no. 2. doi: 10.23638/DMTCS-19-2-9

Cité par Sources :