A note on the distance in random recursive trees

DOI10.1016/j.spl.2006.04.020zbMath1103.05028OpenAlexW2110005503MaRDI QIDQ2432777

Chun Su, Jie Liu, Qunqiang Feng

Publication date: 25 October 2006

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

Full work available at URL: https://doi.org/10.1016/j.spl.2006.04.020

zbMATH Keywords

law of large numbersdistancecentral limit theoremrandom recursive tree

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Distance in graphs (05C12)

Related Items (4)

Retracted: Strong limiting behavior in binary search trees ⋮ Limiting theorems for the nodes in binary search trees ⋮ Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees ⋮ On joint properties of vertices with a given degree or label in the random recursive tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of the theory of records in the study of random trees
• Limiting Distributions for Path Lengths in Recursive Trees
• 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
• On the distribution of distances in recursive trees
• Poisson approximations for functionals of random trees

This page was built for publication: A note on the distance in random recursive trees