Article contents
Asymptotic results on Hoppe trees and their variations
Published online by Cambridge University Press: 16 July 2020
Abstract
A uniform recursive tree on n vertices is a random tree where each possible $(n-1)!$ labelled recursive rooted tree is selected with equal probability. We introduce and study weighted trees, a non-uniform recursive tree model departing from the recently introduced Hoppe trees. This class generalizes both uniform recursive trees and Hoppe trees, providing diversity among the nodes and making the model more flexible for applications. We analyse the number of leaves, the height, the depth, the number of branches, and the size of the largest branch in these weighted trees.
Keywords
- Type
- Research Papers
- Information
- Copyright
- © Applied Probability Trust 2020
References
- 6
- Cited by