Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees

DOI10.1002/rsa.20319zbMath1223.05049arXiv0812.3326OpenAlexW1973441387MaRDI QIDQ5198661

Svante Janson, Luc P. Devroye

Publication date: 9 August 2011

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0812.3326

zbMATH Keywords

branching processprobabilistic analysis of algorithmsrandom Galton-Watson treevertical profilepaths of given length

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (6)

The distance profile of rooted and unrooted simply generated trees ⋮ Random enriched trees with applications to random graphs ⋮ Occupation densities of ensembles of branching random walks ⋮ Large unicellular maps in high genus ⋮ Cutting down trees with a Markov chainsaw ⋮ A decorated tree approach to random permutations in substitution-closed classes

Cites Work

• Asymptotic fringe distributions for general families of random trees
• The density of the ISE and local limit laws for embedded trees
• Tree-based models for random distribution of mass
• Random cutting and records in deterministic and random trees
• Limit laws for embedded trees: Applications to the integrated superBrownian excursion
• On the Altitude of Nodes in Random Trees
• The total progeny in a branching process and a related random walk

This page was built for publication: Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees