首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A local limit theorem for the number of nodes,the height,and the number of final leaves in a critical branching process tree
Authors:Harry Kesten  Boris Pittel
Abstract:Let Zi be the number of particles in the ith generation of a non-degenerate critical Bienaymé-Galton-Watson process with offspring distribution $ p_r = P \{\hbox{a given individual has {\it r} children}\},\kern2em r\geq 0. $ Let ν = Σinfinity0 Zj be the total progeny and let ζ = inf{r: Zr = 0} be the extinction time. Equivalently, ν and ζ are the total number of nodes and (1 + the height), respectively, of the family tree of the branching process. Assume that E{Z1} = Σ prr = 1 and E{Z13 + δ} = Σ prr3 + δ < infinity for some δ ϵ (0, 1). We find an asymptotic formula with remainder term for k4P{ζ = k + 1, Zk = ℓ ν = n} when k→ infinity, which is uniform over n and ℓ. This is used to confirm a conjecture by Wilf that the number of leaves in the last generation of a randomly chosen rooted tree converges in distribution. More precisely, in the terminology introduced above, there exists a probability distribution {q1} such that for n → infinity $ P\{Z_{\zeta-1} = l | \nu=n\} = q_l + O \left({{\log^3 n } \over {n^{1/2}}}\right), $ uniformly over ℓ ≥1. The limiting distribution is identified by means of a functional equation for the generating function Σinfinity1 q s. Numerically, q1 ≅ 0.0602, q2 ≅ 0.248, q3 ≅ 0.094, and q4 ≅ 0.035. Our method can also be used to find lim k→ infinity k4P{ζ = k + 1, Zk = ℓ ν = n} when only E{Z12 + δ} < infinity for some 0 ≤δ≤1, but we do not treat this case here; it goes without saying that the fewer moment assumptions one makes, the poorer the estimates become. © 1996 John Wiley & Sons, Inc.
Keywords:Branching processes  random trees  total progeny  extinction time  height  leaves  local limit theorem
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号