Maximal clades in random binary search trees (Q2256128)

Summary: 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 \textit{M. Drmota}, \textit{M. Fuchs} and \textit{Y.-W. Lee} [``Limit laws for the number of groups formed by social animals under the extra clustering model'' (Extended abstract), in: Proceedings of the 25th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA '14 Paris, Discrete Math. Theor. Comput. Sci., Proc. 2014, 73--84 (2014)] that asymptotic normality holds, but one should normalize using half the variance.