A Strong Law for the Size of Yule M-Oriented Recursive Trees
2012 ◽
Vol 8
(2)
◽
pp. 67-72
Keyword(s):
Abstract Let Nt be the total number of nodes in a Yule m-oriented recursive tree at time t. Then {Nt : t ∈ [0;1)} is a Yule process with birth rates λn = (m(n - 1) + 1)λ for n ≥ 1, where N0 = 1. In this paper, we first give the exact distribution of Nt, then prove that , almost surely
2011 ◽
Vol 48
(04)
◽
pp. 1189-1196
◽
2013 ◽
Vol 50
(02)
◽
pp. 516-532
◽
Keyword(s):
2017 ◽
Vol 09
(02)
◽
pp. 1750021
Keyword(s):
Keyword(s):
Keyword(s):
2019 ◽
Vol 33
◽
pp. 6991-6998
Keyword(s):
2018 ◽
Vol 28
(1)
◽
pp. 81-99
◽
2015 ◽
Vol 52
(1)
◽
pp. 290-297
◽