Article contents
BUILDING RANDOM TREES FROM BLOCKS*
Published online by Cambridge University Press: 19 November 2013
Abstract
Many modern networks grow from blocks. We study the probabilistic behavior of parameters of a blocks tree, which models several kinds of networks. It grows from building blocks that are themselves rooted trees. We investigate the number of leaves, depth of nodes, total path length, and height of such trees. We use methods from the theory of Pólya urns and martingales.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 28 , Issue 1 , January 2014 , pp. 67 - 81
- Copyright
- Copyright © Cambridge University Press 2013
Footnotes
Dedicated to the memory of Philippe Flajolet.
References
- 7
- Cited by