Current browse context:
math.PR
Change to browse by:
References & Citations
Mathematics > Probability
Title: Critical beta-splitting, via contraction
(Submitted on 24 Apr 2024 (v1), last revised 7 May 2024 (this version, v2))
Abstract: The critical beta-splitting tree, introduced by Aldous, is a Markov branching phylogenetic tree of poly-logarithmic height. Recently, by a technical analysis, Aldous and Pittel proved, amongst other results, a central limit theorem for the height $H_n$ of a random leaf.
We give an alternative proof, via contraction methods for random recursive structures. These techniques were developed by Neininger and R\"uschendorf, motivated by Pittel's article "Normal convergence problem? Two moments and a recurrence may be the clues." Aldous and Pittel estimated the first two moments of $H_n$, with great precision. We show that a limit theorem follows, and bound the distance from normality.
Submission history
From: Brett Kolesnik [view email][v1] Wed, 24 Apr 2024 17:53:25 GMT (65kb,D)
[v2] Tue, 7 May 2024 20:32:22 GMT (64kb,D)
Link back to: arXiv, form interface, contact.