Maximal clades in random binary search trees

From MaRDI portal
Publication:2256128

zbMATH Open1320.60027arXiv1408.6337MaRDI QIDQ2256128FDOQ2256128


Authors: Svante Janson Edit this on Wikidata


Publication date: 19 February 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1408.6337

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (1)

Uses Software





This page was built for publication: Maximal clades in random binary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256128)