# The height of random binary unlabelled trees

1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size $n$ is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating functions associated with trees of bounded height.
Keywords :
Type de document :
Communication dans un congrès
Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.121-134, 2008, DMTCS Proceedings
Domaine :
Liste complète des métadonnées

Littérature citée [25 références]

https://hal.inria.fr/hal-01194678
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 7 septembre 2015 - 12:51:01
Dernière modification le : mardi 17 avril 2018 - 11:34:30
Document(s) archivé(s) le : mardi 8 décembre 2015 - 12:58:10

### Fichier

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

### Identifiants

• HAL Id : hal-01194678, version 1

### Citation

Nicolas Broutin, Philippe Flajolet. The height of random binary unlabelled trees. Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.121-134, 2008, DMTCS Proceedings. 〈hal-01194678〉

### Métriques

Consultations de la notice

## 184

Téléchargements de fichiers