The Hitting Time for the Height of a Random Recursive Tree

DOI10.1017/S0963548308009486zbMath1198.05136OpenAlexW2135008448MaRDI QIDQ3608339

Thomas M. Lewis

Publication date: 4 March 2009

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548308009486

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Unnamed Item
• Uniform recursive trees: branching structure and simple random downward walk
• Applications of the theory of records in the study of random trees
• On the distribution of leaves in rooted subtrees of recursive trees
• A strong law for the height of random binary pyramids
• Breakage and restoration in recursive trees
• The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
• Review of the stirling numbers, their generalizations and Statistical Applications
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• A Probability Model of a Pyramid Scheme
• Climbing certain types of rooted trees. II
• Asymptotic degree distribution in random recursive trees
• On the distribution of distances in recursive trees
• Stirling Behavior is Asymptotically Normal

This page was built for publication: The Hitting Time for the Height of a Random Recursive Tree