Depth of nodes in random recursive
Information Processing Letters(2006)
摘要
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 n th node. It is further shown that the limiting distribution of the normalized depth of this node is a standard normal distribution.
更多查看译文
关键词
analysis of algorithms,combinatorial problems,recursive trees,limiting distributions
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要