Back to Blog
Field Notes

Galton-Watson Process

In this post, we outline the Galton-Watson Process.

Galton-Watson Process

Summary

Given a population where each individual reproduces independently with the same offspring distribution, will the population eventually die out, and how do we characterize that mathematically?

Body

  • We start with a root node (generation 0). The number of children this root node has is a random variable ξ\xi (offspring distribution).
  • Plain-language note: a Random Variable is the “number-generating machine,” and the distribution is the recipe for the odds of each number (e.g., 0 kids 30%, 1 kid 40%, 2 kids 20%, 3 kids 10%).

What does it mean when “each individual reproduces independently with the same offspring distribution”?

  • suppose we have a root node. It reproduces and has three kids. These three kids now reproduce.
  • The probability these kids have some number of children, is the same (i.e. idendically distributed). They are also independed of each other.

#Definition The probability of having ii children, with i0i \geq 0, is

pi=P{ξ=i},i0p_i = \mathbf{P}\{\xi = i\}, \quad i \geq 0
  • e.g. p0=P{ξ=0}p_0 = \mathbf{P}\{\xi = 0\} is the probability of having no children.
  • If p0=1p_0 = 1, then ξ=0\xi = 0 almost surely and the population dies out immediately.

#Definition Let ZnZ_n be the number of individuals in generation nn

  • Z0=1Z_0 = 1
  • the next generation, Zn+1Z_{n+1}, is the sum of all offspring of the current generation. It is characterized below:
Zn+1=k=1Znξn,kZ_{n+1} = \sum_{k=1}^{Z_n} \xi_{n,k}
  • for k=1k=1 up to ZnZ_n, i.e. iteratre over all nodes in the current generation.
  • we sum up the number of children produced by each kk, i.e. ξn,k\xi_{n,k}.
    • the reproduction factor is i.i.d. copies of ξ\xi (branching property).

#Definition Malthusian Parameter Mean offspring number m=E[ξ]=iipim = \mathbb{E}[\xi] = \sum_i i p_i controls growth:

  • m<1m < 1 (subcritical): extinction occurs with probability 1 and E[Zn]=mn\mathbb{E}[Z_n] = m^n decays.
  • m=1m = 1 (critical): extinction occurs with probability 1 (unless ξ1\xi \equiv 1), but more slowly.
  • m>1m > 1 (supercritical): positive probability of survival.

Connections

  • Markov chains: (Zn)(Z_n) is a Markov chain on N0\mathbb{N}_0 with absorbing state 0.
  • Random trees: The family tree of the process is a random rooted tree.
  • Phase transitions: The critical value m=1m=1 separates almost-sure extinction from possible survival.
  • Reproduction Generating Function (RGF)

Sources

  • Bienayme (1845)
  • Galton and Watson (1874)
  • Jagers (2009)