The climbing depth of random trees

Authors:
Alois Panholzer
Affiliations:
Institut Für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstrasse 8–10/104, A-1040 Wien, Austria
Venue:
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Year:
2005

Citing 0
Cited 2

Profiles of random trees: Plane-oriented recursive trees

Random Structures & Algorithms
On climbing tries

Probability in the Engineering and Informational Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study here for certain rooted tree families the number of steps that are necessary to climb a random tree of size n. We give distributional results for this parameter for increasing tree families and unordered unlabeled rooted trees. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2005This work was supported by the “Stiftung Aktion Österreich-Ungarn” within the project “Applications of Trees in Computer Science.”