Isolating the most recent entry in a random recursive tree by random cuts

DOI10.1007/BF02936155zbMath1055.05031OpenAlexW2084612549MaRDI QIDQ1885072

Mehri Javanian, Mohammed Q. Vahidi-Asl

Publication date: 28 October 2004

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936155

zbMATH Keywords

recursive tree

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05)

Cites Work

• Note on the outdegree of a node in random recursive trees
• Cutting down recursive trees
• Distribution of nodes of a tree by degree
• FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH
• A Probability Model of a Pyramid Scheme
• On the covariance of the level sizes in random recursive trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Isolating the most recent entry in a random recursive tree by random cuts