Note on the outdegree of a node in random recursive trees

DOI10.1007/BF02936077zbMath1040.05006OpenAlexW2028039849MaRDI QIDQ1429335

Mehri Javanian, Mohammed Q. Vahidi-Asl

Publication date: 18 May 2004

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

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

zbMATH Keywords

recursive treesout-degrees

Mathematics Subject Classification ID

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

Related Items (2)

Isolating the most recent entry in a random recursive tree by random cuts ⋮ On the degree distribution of the nodes in increasing trees

Cites Work

• Applications of the theory of records in the study of random trees
• Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are Unreliable
• On the number of terminal vertices in certain random trees with an application to stemma construction in philology
• Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees
• Random recursive forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Note on the outdegree of a node in random recursive trees