A strong law for the height of random binary pyramids

DOI10.1214/AOAP/1177004977MaRDI QIDQ1336596zbMATH OpenOpenAlexFDO

Authors Hosam M. Mahmoud

Publication date 14 May 1995

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177004977

zbMATH Keywords

branching processrandom treesstrong laws

Mathematics Subject Classification ID

Strong limit theorems (60F15) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Recommendations

• On the total heights of random rooted binary trees
• A cut-invariant law of large numbers for random heaps
• The height of random binary unlabelled trees
• Almost-sure asymptotics for the number of heaps inside a random sequence
• The distribution of height and diameter in random non-plane binary trees
• scientific article; zbMATH DE number 694915
• On the Variance of the Height of Random Binary Search Trees
• On the height of random m‐ary search trees

Cited in

(7)

• The Hitting Time for the Height of a Random Recursive Tree
• Weighted height of random trees
• A diffusion limit for a class of randomly-growing binary trees
• Search problems in groups and branching processes.
• A tight bound for black and white pebbles on the pyramid
• The existence of a giant cluster for percolation on large Crump–Mode–Jagers trees
• A note on the growth of random trees

This page was built for publication: A strong law for the height of random binary pyramids

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