Answers are grounded in this paper and cite their sources.
Recursive trees have been used to model such things as the spread of epidemics, family trees of ancient manuscripts, and pyramid schemes. A tree T n with n labeled nodes is a recursive tree if n = 1, or n > 1 and T n can be constructed by joining node n to a node of some recursive tree T n– 1 . For arbitrary nodes i < n in a random recursive tree we give the exact distribution of X i,n , the distance between nodes i and n. We characterize this distribution as the convolution of the law of X i,j+ 1 and n – i – 1 Bernoulli distributions. We further characterize the law of X i,j+ 1 as a mixture of sums of Bernoullis. For i = i n growing as a function of n , we show that is asymptotically normal in several settings.
No takes yet. Share an insight, caveat, or question.
Robert P. Dobrow (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: