Geodesic
Maximal clades in random binary search trees
Svante Janson1
1Uppsala University
The electronic journal of combinatorics, Tome 22 (2015) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We study maximal clades in random phylogenetic trees with the Yule-Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In particular, we give an explanation of the curious phenomenon observed by Drmota, Fuchs and Lee (2014) that asymptotic normality holds, but one should normalize using half the variance.
DOI : 10.37236/4646
Classification : 60C05, 05C05, 60F05
Mots-clés : phylogenetic trees, binary search trees, maximal clades, Yule-Harding model

Svante Janson  1

1 Uppsala University 
@article{10_37236_4646,
     author = {Svante Janson},
     title = {Maximal clades in random binary search trees},
     journal = {The electronic journal of combinatorics},
     year = {2015},
     volume = {22},
     number = {1},
     doi = {10.37236/4646},
     zbl = {1320.60027},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/4646/}
}
TY  - JOUR
AU  - Svante Janson
TI  - Maximal clades in random binary search trees
JO  - The electronic journal of combinatorics
PY  - 2015
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/4646/
DO  - 10.37236/4646
ID  - 10_37236_4646
ER  - 
%0 Journal Article
%A Svante Janson
%T Maximal clades in random binary search trees
%J The electronic journal of combinatorics
%D 2015
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/4646/
%R 10.37236/4646
%F 10_37236_4646
Svante Janson. Maximal clades in random binary search trees. The electronic journal of combinatorics, Tome 22 (2015) no. 1. doi: 10.37236/4646

Cité par Sources :