Answers are grounded in this paper and cite their sources.
We consider growing random recursive trees in random environments, which at each step a new vertex is attached (by an edge of length) to an existing tree vertex according to a distribution that assigns the tree vertices masses to their random weights. The main aim of the paper is study the asymptotic behaviour of the distance from the newly vertex to the tree's root and that of the mean numbers of vertices as the number of steps tends to ∞. Most the results are obtained under the assumption that the random have a product form with independent, identically factors.
No takes yet. Share an insight, caveat, or question.
Borovkov et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: