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.
Mathematics Subject Classification (2000): 60J80, 05C05
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chayes, J.L., Chayes, L., and Durret, R.: Connectivity properties of Mandelbrot's percolation process. Prob. Theor. Rel. Fields 77, 307–324 (1988)
Dekking, F.M.: Branching processes that grow faster than binary splitting. Amer. Math. Monthly 98, 728–731 (1991)
Galton, F.: Problem 4001. Educational Times 1 April, 17 (1873)
Harris, T.E.: The Theory of Branching Processes. Springer, Berlin (1963)
Jagers, P.: Branching Processes with Biological Applications. Wiley, London (1975)
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)
Mutafchiev, L.R.: Survival probabilities for N-ary subtrees on a Galton–Watson family tree. Statist. Probab. Lett. 78, 2165–2170 (2008)
Pakes, A.G., Dekking, F.M.: On family trees and subtrees of simple branching processes. J. Theor. Probab. 4, 353–369 (1991)
Pemantle, R.: Phase transition in reinforced random walk and RWRE on trees. Ann. Probab. 16, 1229–1241 (1988)
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)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yanev, G.P. (2010). Extension of the problem of extinction on Galton–Watson family trees. In: González Velasco, M., Puerto, I., Martínez, R., Molina, M., Mota, M., Ramos, A. (eds) Workshop on Branching Processes and Their Applications. Lecture Notes in Statistics(), vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11156-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-11156-3_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11154-9
Online ISBN: 978-3-642-11156-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)