The height of scaled attachment random recursive trees

Luc Devroye 1 Omar Fawzi 2 Nicolas Fraiman 2
1 SOCS - School of Computer Science [Quebec]
2 Department of Mathematics and Statistics [Mac Gill]
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.
Keywords : Random recursive tree Random web model Power of choice Renewal process Second moment method
Type de document :
Communication dans un congrès
Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.129-142, 2010, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [26 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01185586
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 20 août 2015 - 16:33:17
Dernière modification le : mardi 7 mars 2017 - 15:07:31
Document(s) archivé(s) le : mercredi 26 avril 2017 - 09:46:32

Fichier

dmAM0110.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01185586, version 1

Collections

INSMI | TDS-MACS

Citation

Luc Devroye, Omar Fawzi, Nicolas Fraiman. The height of scaled attachment random recursive trees. Drmota, Michael and Gittenberger, Bernhard. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), pp.129-142, 2010, DMTCS Proceedings. 〈hal-01185586〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

202

Téléchargements de fichiers

156

Contact


archive-ouverte@inria.fr