A Strong Law for the Size of Yule M-Oriented Recursive Trees
By: Mehri Javanian and Mohammad Q. Vahidi-Asl
Open Access
|Apr 2013Abstract
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
Language: English
Page range: 67 - 72
Published on: Apr 13, 2013
Published by: University of Ss. Cyril and Methodius in Trnava
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2013 Mehri Javanian, Mohammad Q. Vahidi-Asl, published by University of Ss. Cyril and Methodius in Trnava
This work is licensed under the Creative Commons License.