Skip to Main content Skip to Navigation
Conference papers

The height of scaled attachment random recursive trees

Abstract : We study depth properties of a general class of random recursive trees where each node $n$ attaches to the random node $\lfloor nX_n \rfloor$ and $X_0, \ldots , X_n$ is a sequence of i.i.d. random variables taking values in $[0,1)$. We call such trees scaled attachment random recursive trees (SARRT). We prove that the height $H_n$ of a SARRT is asymptotically given by $H_n \sim \alpha_{\max} \log n$ where $\alpha_{\max}$ is a constant depending only on the distribution of $X_0$ whenever $X_0$ has a bounded density. This gives a new elementary proof for the height of uniform random recursive trees $H_n \sim e \log n$ that does not use branching random walks.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 4:33:17 PM
Last modification on : Thursday, June 18, 2020 - 12:32:05 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:46:32 AM


Publisher files allowed on an open archive




Luc Devroye, Omar Fawzi, Nicolas Fraiman. The height of scaled attachment random recursive trees. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.129-142, ⟨10.46298/dmtcs.2788⟩. ⟨hal-01185586⟩



Record views


Files downloads