# 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 :
Document type :
Conference papers
Domain :

Cited literature [25 references]

https://hal.inria.fr/hal-01194678
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, September 7, 2015 - 12:51:01 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Tuesday, December 8, 2015 - 12:58:10 PM

### File

dmAI0106.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : hal-01194678, version 1

### Citation

Nicolas Broutin, Philippe Flajolet. The height of random binary unlabelled trees. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.121-134. ⟨hal-01194678⟩

Record views