Extension of the problem of extinction on Galton–Watson family trees
Abstract
We review the existing and present new results on certain subtrees of the Galton-Watson family tree. For a positive integer N, define an N-ary subtree to be the tree of a deterministic N-splitting, rooted at the ancestor. Dekking (Amev. Math. Monthly 98:728–731, 1991) raised and answered the question how to compute the probability for a branching process to possess the binary splitting property, i.e., N = 2. Pakes and Dekking (J. Theor. Probab. 4:353–369, 1991) studied the general situation when N ≥ 2. Surprisingly, the case N ≥ 2 is studied so late, whereas the question for extinction of a branching process, i.e., non-existence of an infinite unary subtree (N = 1) has been studied extensively over the past 120–150 years.
Keywords
branching process Galton-Watson family trees binary and N-ary trees geometric offspring Poisson offspringPreview
Unable to display preview. Download preview PDF.
References
- 1.Chayes, J.L., Chayes, L., and Durret, R.: Connectivity properties of Mandelbrot's percolation process. Prob. Theor. Rel. Fields 77, 307–324 (1988)MATHCrossRefGoogle Scholar
- 2.Dekking, F.M.: Branching processes that grow faster than binary splitting. Amer. Math. Monthly 98, 728–731 (1991)MATHCrossRefMathSciNetGoogle Scholar
- 3.Galton, F.: Problem 4001. Educational Times 1 April, 17 (1873)Google Scholar
- 4.Harris, T.E.: The Theory of Branching Processes. Springer, Berlin (1963)Google Scholar
- 5.Jagers, P.: Branching Processes with Biological Applications. Wiley, London (1975)Google Scholar
- 6.Kemeny, J.G., Snell, J.L.: Mathematical Models in the Social Sciences, Reprint of the 1962 ed., issued in series: Introduction to higher mathematics, The MIT Press, Cambridge, MA (1972)Google Scholar
- 7.Mutafchiev, L.R.: Survival probabilities for N-ary subtrees on a Galton–Watson family tree. Statist. Probab. Lett. 78, 2165–2170 (2008)MATHCrossRefMathSciNetGoogle Scholar
- 8.Pakes, A.G., Dekking, F.M.: On family trees and subtrees of simple branching processes. J. Theor. Probab. 4, 353–369 (1991)MATHCrossRefMathSciNetGoogle Scholar
- 9.Pemantle, R.: Phase transition in reinforced random walk and RWRE on trees. Ann. Probab. 16, 1229–1241 (1988)MATHCrossRefMathSciNetGoogle Scholar
- 10.Pittel, B., Spencer, J. Wormald, N.: Sudden emergence of a giant k-core in a random graph. J. Combin. Theory Ser. B 67, 111–151 (1996)MATHCrossRefMathSciNetGoogle Scholar
- 11.Yanev, G.P., Mutafchiev, L.R.: Number of complete N-ary subtrees on Galton–Watson family trees. Methodol. Comput. Appl. Probab. 8, 223–233 (2006)MATHCrossRefMathSciNetGoogle Scholar