Branching
Branching processes are a type of stochastic process that models the growth of a population. The process starts with one individual, called the ancestor, and each individual can produce a random number of offspring. The number of offspring is typically modeled by a probability distribution. The process continues recursively, with each individual producing offspring, and the process stops when no individual has any offspring.
Throughout, we consider a offspring distribution of a non-negative integer-valued random variable with mean and PMF .
Generating Function
The generating function of the branching process is
Similar to Moment Generating Function and Characteristic Function, the generating function uniquely determines the offspring distribution and thus the branching process.1
Extinction Probability
Let be the probability that the branching process goes extinct. Then, is the smallest fixed point of the generating function, i.e., . This is because, the process goes extinct iff the subprocesses generated by the offsprings of the ancestor all go extinct. Since they are i.i.d. as the original process, we have
Let’s examine the graph of on . We have , , , , and . In the supercritical regime , at least for one we have , and thus on .
There are two intersections of and the line when . Let be the probability that -th generation goes extinct. We have , , and in general . Thus, the extinction probability approaches the lower intersection from below (the zig-zag lines).
We summarize the scenarios in the following table
| PMF | ||
|---|---|---|
| any | ||
Note that when , is equivalent to .
Derived Random Variable
Number of Offsprings
Let represents the number of -th generation offsprings. Let . The process goes extinct iff . We have
Thus,
When , the above expectation is finite, and thus is finite with probability one.
Extinction time
Let be the number of generations until extinction, i.e., . Then
Footnotes
-
In fact, the generating function is equivalent to the MGF by setting . ↩