Asymptotic results on Hoppe trees and their variations
Keyword(s):
AbstractA 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.
2019 ◽
Vol 33
◽
pp. 6991-6998
Keyword(s):
Keyword(s):
2019 ◽
Vol 7
(sp2)
◽
pp. 29
Keyword(s):
2018 ◽
Vol 45
(3)
◽
pp. 263
Keyword(s):
2021 ◽
Vol 13
(2)
◽
pp. 413-426
Keyword(s):
1990 ◽
Vol 27
(01)
◽
pp. 124-133
◽
2011 ◽
Vol 48
(04)
◽
pp. 1189-1196
◽