Konstantin Borovkov ; Vladimir Vatutin

Trees with productform random weights
dmtcs:3491 
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities

https://doi.org/10.46298/dmtcs.3491
Trees with productform random weights
Authors: Konstantin Borovkov ^{1}; Vladimir Vatutin ^{2}
NULL##NULL
Konstantin Borovkov;Vladimir Vatutin
1 Department of Mathematics and Statistics [Melbourne]
2 Steklov Mathematical Institute [Moscow]
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached according to a probability distribution that assigns the tree vertices masses proportional to their random weights.The main aim of the paper is to study the asymptotic behavior of the mean numbers of outgoing vertices as the number of steps tends to infinity, under the assumption that the random weights have a product form with independent identically distributed factors.