Extinction probability of a branching process Created 2026-10-07 Updated 2026-10-14
For a Galton-Watson process with one ancestor, the branching extinction probability is the probability that some generation is empty:
The equality uses the absorbing state at zero. The complementary branching survival probability is the probability that every generation is nonempty. The Galton-Watson extinction fixed point computes from the offspring distribution.
For , , one ancestor has . Starting instead from ancestors with independent descendant families gives
All families must die out. With three ancestors, eventual extinction has probability and survival has probability ; by generation two, extinction has probability . Extra ancestors change the extinction probability without changing the offspring distribution. [ref]
For finite offspring mean , the extinction classification is:
  • If , extinction has probability . For example , gives and ; its only fixed point in is .
  • If and , extinction also has probability . For example gives and , despite expected generation size in a Galton-Watson process remaining one.
  • If , extinction has probability . The value can be zero: if , every individual has at least one child, so an initially nonempty family never becomes empty. In particular gives and .
The critical exception is : every individual has exactly one child, , and forever from one ancestor. Thus but ; a blanket claim that every critical Galton-Watson process becomes extinct would be false. These cases concern the Galton-Watson process with its common offspring distribution and independence assumptions. [ref]
This probability answers whether any lineage persists, which the offspring mean alone cannot quantify in the supercritical case. A branching process conditioned on extinction uses the same fixed point to reweight reproduction and describe families known eventually to die out.
Galton-Watson process Created 2026-09-24 Updated 2026-10-13
A Galton-Watson process is a branching process that counts individuals by generation. Start with one ancestor, , and let all offspring counts be independent and identically distributed random variables taking nonnegative integer values with a common offspring distribution. Then
The empty sum is zero: zero is an absorbing state, so once a generation is empty every later generation is empty. The same offspring distribution applies to every individual in every generation. [ref]
For a concrete offspring distribution, take , , , and for . An individual has no children with probability , one with probability , and two with probability . The offspring expected value is . A possible sequence of generation sizes is : two children need not lead to a permanently growing family.
The probability generating function gives the exact generation probability distributions through branching-process generating-function iteration. With and , the second generation has
Thus and . The figure shows full generation probability mass functions, computed by polynomial function composition, through generation six; no simulated frequencies are used.
Figure 1.
Exact Galton-Watson generation distributions: growing means and increasing extinction mass
. Details.
The contrast is striking: the expected generation size in a Galton-Watson process grows as , while the branching extinction probability is . By generation six, although . Larger surviving families carry the rising expected value; that mean is an average over possible families, not a forecast of one family's path. The Galton-Watson extinction fixed point turns an unbounded number of future generations into a single equation for this probability.
The historical question was the disappearance of surnames passed through male descendants. In Watson and Galton, On the Probability of the Extinction of Families, pages 139–140, Francis Galton formulates a constant-law model counting sons who reach adulthood, and Watson computes later generation probability distributions by composing generating functions. Those are assumptions of their model, rather than a claim that actual human reproduction follows this offspring distribution.
Start the Galton-Watson process with one ancestor, , and let every individual independently have a number of offspring distributed as . With independent copies ,
where an empty sum is zero. Extinction is the event that some generation is empty; zero is then absorbing. Write for its probability and for the survival probability.
Set , with . Conditional on the ancestor's number of children, extinction by generation requires independent extinction by generation in every child subtree. Thus
The events increase, so . The probability generating function is continuous on , by domination of by , giving . If is any fixed point, then and monotonicity of inductively gives . Taking limits proves the Galton-Watson extinction fixed point characterization:
In particular it is the smallest nonnegative fixed point wherever the generating series is defined, since it already lies in .
Let , allowing . The probability generating function is increasing and convex, with . If , its tangent inequality gives for , so . If and , there is positive mass at both zero and some integer at least two; strict convexity gives for , again . The exceptional case almost surely has one individual forever, so despite .
If , the left derivative at gives for sufficiently close to . Since , continuity supplies a fixed point below , possibly . Thus survival has positive probability precisely when , apart from deterministic one-child reproduction.
For the random bipartite graph, early exploration of a component alternates between the two vertex classes. Before many vertices are exposed, each discovered vertex has approximately new neighbors in the other class, since tends to that distribution. The two-type mean offspring matrix is
with spectral radius ; equivalently, the mean growth over two generations is . The branching-process comparison therefore predicts a giant component exactly when
For , the local process dies out almost surely, so no linear-sized component is expected; is the critical case, not a positive-survival exception. For , the symmetric survival probability is , where , predicting approximately vertices in the giant. This last passage from local survival to a unique giant is the usual random-graph exploration argument; the branching-process reasoning here supplies the requested threshold explanation rather than a proof of that global theorem.
An uneventful day leaves one aphid, a one-offspring day leaves the parent plus its offspring, and a two-offspring day leaves three aphids. Death leaves none. Thus the daily descendant counts are with probabilities , , , , respectively. The mean and probability generating function are
Independence across individuals and days makes the daily population a Galton-Watson process, with each surviving parent counted as one of the next day's descendants.
The standard Galton-Watson extinction fixed point result states that the eventual extinction probability of a branching process from one ancestor is the smallest root in of . Moreover a nondegenerate offspring law of mean at most one has extinction probability of a branching process one. Here, since , the fixed-point equation reduces to
which contains no . This proves laziness invariance of branching extinction: uneventful days change the timescale, not eventual extinction. The excluded case would keep one aphid forever.
If , the offspring mean is at most one. In this parameter range : if , then would imply . Thus the offspring law is not deterministically one, and the extinction criterion applies. Extinction is certain.
For the specified probabilities, the fixed-point equation factors as
Its roots in are and , and the smaller root is the extinction probability of a branching process:
The Galton-Watson extinction fixed point equation is
Its smallest root in is , not the other allowed fixed point . Consequently the large-depth escape probability is
For finite , the exact escape probability is and is slightly larger. Indeed , and the mean value theorem on gives . This also quantifies how quickly the finite-depth answer approaches the displayed limit.
The eventual extinction probability is the smallest solution . This is the Galton-Watson extinction fixed point result for one initial individual. Equivalently,
since having an empty generation is an absorbing event and the extinction-by-generation events increase. In particular extinction is certain when the smallest fixed point is one. With , an offspring mean at most one implies this, whereas a mean greater than one gives a fixed point below one. The fixed-point statement itself requires no finite-mean assumption.
Summing the geometric series for the offspring probability generating function gives
The fixed-point equation is , whose only root in is one. The Galton-Watson extinction fixed point result therefore proves extinction is certain.
For the explicit iterates, the proposed formula at is , so the base case holds. If it holds at , part (a) gives
This is exactly the same formula with replaced by . By induction,
Evaluating the probability generating function at zero selects the mass of an empty generation:
These probabilities increase to one, also confirming the extinction conclusion directly.
For the binomial branching process, the offspring probability generating function is . The Galton-Watson extinction fixed point gives .
The printed finite-binomial upper bound is false without an additional asymptotic qualification. For and , solving the fixed-point equation exactly gives
For instance gives . More generally, at every fixed the Taylor expansion gives , again contradicting that upper bound for sufficiently small positive .
Here is the corrected binomial branching survival correction. The Poisson branching process of mean has branching survival probability satisfying . Expanding the logarithm gives
Thus , which implies the requested lower estimate . Since on , iteration of the two offspring probability generating functions gives .
For the actual binomial branching process, expansion of its exact fixed-point equation gives
If , all coefficients are nonnegative. Keeping the first term proves
In particular, for and this gives . The printed bounds also hold for the binomial branching process in an explicit large- regime: and . Indeed these conditions give and . In the preceding nonnegative series, evaluation at gives
The series is increasing, and its value at the actual branching survival probability is , so . Together with the lower bound already proved, this recovers in that regime. In particular it applies eventually to part (ii). The counterexample shows why a regime condition is needed for a literal finite- statement.
Figure 1.
Finite-binomial survival exceeds the printed upper bound, while Poisson survival lies between the corrected comparison bounds
. Details.
Let be the size of generation . This is a Galton-Watson process with offspring mean
The expected generation size in a Galton-Watson process is therefore
Its probability generating function is
By the Galton-Watson extinction fixed point, the extinction probability is the smallest solution in of . Factoring gives
so . The probability of production continuing forever is
Let be the probability of extinction by generation . Conditioning on the initial individual's offspring gives
The events increase to eventual extinction, so and continuity gives . If is any other fixed point, induction from and monotonicity of gives for every . Hence , proving the Galton-Watson extinction fixed point characterization.