Indexed metadata

Maximal Clades in Random Binary Search Trees

Svante Janson

Source record

Source: Crossref

Published: Feb 16, 2015

DOI: 10.37236/4646

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Maximal Clades in Random Binary Search Trees — Mathematical Frontier Network