Answers are grounded in this paper and cite their sources.
Let Z n 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 Z n is F n ( 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
No takes yet. Share an insight, caveat, or question.
E. Seneta (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: