Random trees have height \(O(\sqrt{n})\)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Scaling limits of random graphs from subcritical classes
Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
Spanning forests in regular planar maps
Critical random graphs: limiting constructions and distributional properties
Random graphs from a block-stable class
The continuum random tree. I
The number of homeomorphically irreducible trees, and other species
A mating-of-trees approach for graph distances in random planar maps
École d'été de probabilités de Saint-Flour XIII - 1983
Bijective counting of tree-rooted maps and shuffles of parenthesis systems
The average height of binary trees and other simple trees
Most trees are short and fat
SLE as a mating of trees in Euclidean geometry
Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
Universal height and width bounds for random trees
Global lower mass-bound for critical configuration models in the heavy-tailed regime
The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
Random tree-weighted graphs
Universality for critical heavy-tailed network models: metric structure of maximal components
Limits of random tree-like discrete structures
Liouville quantum gravity spheres as matings of finite-diameter trees
Sub-exponential tail bounds for conditioned stable Bienaymé-Galton-Watson trees
The continuum random tree. III
Active spanning trees with bending energy on planar maps and SLE-decorated Liouville quantum gravity for \(\kappa>8\)
Tail bounds for the height and width of a random tree with a given degree sequence
The Enumeration of Trees by Height and Diameter
On the Altitude of Nodes in Random Trees
The Distribution of Heights of Binary Trees and Other Simple Trees
On the Tchebychef Inequality of Bernstein
On the Enumeration of Tree-Rooted Maps
On the height of trees
The distance between points in random trees
Réarrangements de fonctions et dénombrement
The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses

This page was built for publication: Random trees have height \(O(\sqrt{n})\)