<abstract xmlns="http://www.w3.org/1999/xhtml"> 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 <disp-formula><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="graphic/v10294-012-0015-1_fig1.tif"></graphic></disp-formula>, almost surely </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

A Strong Law for the Size of Yule M-Oriented Recursive Trees

Department of Statistics, Faculty of Sciences, University of Zanjan, Zanjan, Iran

Department of Statistics, Faculty of Mathematical Sciences, Shahid Beheshti University, Evin, Tehran

Journal of Applied Mathematics, Statistics and Informatics

{"article-title":"A Strong Law for the Size of Yule M-Oriented Recursive Trees"}

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) +...

A Strong Law for the Size of Yule M-Oriented Recursive Trees

Online veröffentlicht: 13. Apr. 2013

Seitenbereich: 67 - 72

DOI: https://doi.org/10.2478/v10294-012-0015-1

This content is open access.