Universal height and width bounds for random trees

We prove non-asymptotic stretched exponential tail bounds on the height of a randomly sampled node in a random combinatorial tree, which we use to prove bounds on the heights and widths of random trees from a variety of models. Our results allow us to prove a conjecture and settle an open problem of...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Addario-Berry, Louigi, Brandenberger, Anna, Hamdan, Jad, Kerriou, Céline
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!