Skip to Main content Skip to Navigation
Conference papers

The height of random binary unlabelled trees

Nicolas Broutin 1 Philippe Flajolet 1 
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.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, September 7, 2015 - 12:51:01 PM
Last modification on : Friday, February 4, 2022 - 3:10:16 AM
Long-term archiving on: : Tuesday, December 8, 2015 - 12:58:10 PM


Publisher files allowed on an open archive




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



Record views


Files downloads