The height and width of simple trees

MaRDI QIDQ4524565zbMATH OpenFDO

Authors Philippe Chassaing, Jean-François Marckert, Marc Yor

Publication date 15 January 2001

zbMATH Keywords

binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The Distribution of Heights of Binary Trees and Other Simple Trees
• Width and mode of the profile for some random trees of logarithmic height
• Most trees are short and fat
• The height of random binary unlabelled trees
• On the asymptotic joint distribution of height and width in random trees

Cited in

(15)

• A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
• Trees with power-like height dependent weight
• Random cutting and records in deterministic and random trees
• scientific article; zbMATH DE number 508964 (Why is no real title available?)
• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation
• The height of increasing trees
• On the joint distribution of the area and the number of peaks for Bernoulli excursions
• Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
• Random trees have height \(O(\sqrt{n})\)
• Uniform attachment with freezing: scaling limits
• The shape of unlabeled rooted random trees
• Tight universal bounds on the height times the width of random trees
• On certain functionals of the maximum of Brownian motion and their applications

This page was built for publication: The height and width of simple trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524565)