Abstract
We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree and the standard preferential attachment tree. An application is given to the sum over all pairs of nodes of the common number of ancestors.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Voronoi cells in random split trees;Annales Henri Lebesgue;2024-06-27
2. Sharp bound on the truncated metric dimension of trees;Discrete Mathematics;2023-08
3. Tree evolution processes for bucket increasing trees;Discrete Mathematics;2023-07
4. Random recursive hypergraphs;Journal of Physics A: Mathematical and Theoretical;2023-04-14
5. On Several Properties of A Class of Hybrid Recursive Trees;Methodology and Computing in Applied Probability;2023-02-08