Abstract
Let Zn be the number of individuals in the n-th generation of a simple (discrete, one-type) Galton-Watson process, descended from a single ancestor. Write and assume, as usual, that 0 < F(0) < 1. It is well known that the p.g.f. of Zn is Fn(s), the n-th functional iterate of F(s), and that if the process is construed as a Markov chain on the states 0, 1, 2,…, then its n-step transition probabilities are given by
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference8 articles.
1. On a theorem of Paul Lévy;Sekeres;Magyar Tud. Akad. Mat. Kutató Int. Közl. A,1960
2. The Galton-Watson Process with mean one and finite variance;Kesten;Teor. Veroyat. Primen,,1966
3. On convex solutions of Abel's functional equation;Kuczma;Bull. Acad. Polon. Sci.,1965
4. On quasi-stationary distributions in discrete-time Markov chains with a denumerable infinity of states
5. Sur un point de la théorie des files d'attente;Breny;Ann. Soc. Sci. Bruxelles.,1962
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献