CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
Asymptotic degree distribution in random recursive trees
Random Structures & Algorithms - Proceedings of the Eleventh International Conference "Random Structures and Algorithms," August 9—13, 2003, Poznan, Poland
Graphs and Hypergraphs
Hi-index | 0.89 |
In this paper, we find the expected degree of each node in random recursive k-ary trees. The expression found for the expected value is used to determine the exact distribution of the depth of nth node. It is further shown that the limiting distribution of the normalized depth of this node is a standard normal distribution.