A note on the growth of random trees

DOI10.1016/S0167-7152(96)00092-2zbMath0904.60067MaRDI QIDQ1380543

J. D. Biggins, D. R. Grey

Publication date: 8 March 1998

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

exponential growthsearch treerecursive treegeneral branching processarithmetic growth

Mathematics Subject Classification ID

Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (7)

Edgeworth expansions for profiles of lattice branching random walks ⋮ Long and short paths in uniform random recursive dags ⋮ General Edgeworth expansions with applications to profiles of random trees ⋮ Weighted height of random trees ⋮ The variance of the average depth of a pure birth process converges to 7 ⋮ On the asymptotic behaviour of random recursive trees in random environments ⋮ Search problems in groups and branching processes

Cites Work

• Unnamed Item
• On growing random binary trees
• Branching processes in the analysis of the heights of trees
• The first birth problem for an age-dependent branching process
• A strong law for the height of random binary pyramids
• The growth and spread of the general branching random walk
• On the convergence of supercritical general (C-M-J) branching processes
• On the height of random m‐ary search trees
• A note on the height of binary search trees
• Chernoff's theorem in the branching random walk
• Note on the heights of random recursive trees and random m‐ary search trees

This page was built for publication: A note on the growth of random trees