The height of scaled attachment random recursive trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2010

The height of scaled attachment random recursive trees

Résumé

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.
Fichier principal
Vignette du fichier
dmAM0110.pdf (352.08 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01185586 , version 1 (20-08-2015)

Identifiants

Citer

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⟩

Collections

TDS-MACS
111 Consultations
596 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More