 |
Discrete Mathematics & Theoretical Computer Science |
Konstantin Borovkov ; Vladimir Vatutin - Trees with product-form 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.3491Trees with product-form random weightsArticle
- 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.
Source: HAL:hal-01184695v1
Volume: DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
Section: Proceedings
Published on: January 1, 2006
Imported on: May 10, 2017
Keywords: random recursive trees,random environment,Sptizer's condition,distance to the root,outdegrees,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]
1 Document citing this article
Consultation statistics
This page has been seen 286 times.
This article's PDF has been downloaded 200 times.