Home / Intelligence Log / Probability Theory Probability Theory

Recursive Probability: Solving the Amoeba Extinction Problem

The Question

We begin with exactly one amoeba. Every minute, independently and with equal probability — one-third for each outcome — it does one of three things: it dies and leaves no offspring, it survives unchanged and produces no new cells, or it divides into exactly two amoebas. Each of those two daughter amoebas then faces the same three possible outcomes in the next minute, acting entirely independently of each other and of any other amoebas in the population. This process repeats indefinitely.

The question: what is the probability that the entire population eventually goes extinct — that is, reaches zero amoebas — at some point in the future?

This is a classic problem from quant finance interviews, appearing regularly at Goldman Sachs, Morgan Stanley, Citadel, and Two Sigma. Its power as an interview question lies in the multiple layers of wrong reasoning available to candidates who have not seen the branching process framework. The correct answer is that extinction is certain — the probability is exactly 1 — and the proof requires nothing more than the law of total probability, a quadratic equation, and a careful argument about which root to select. But getting there demands recognizing the recursive structure of the problem.

Note carefully what "eventual extinction" means: we are not asking whether the population goes extinct in any fixed time window. We are asking whether, over an infinite time horizon, the probability of the population ever hitting zero is strictly positive, and what that probability is. The answer, as we will show, is that it equals 1 — extinction is not just possible but guaranteed, in the sense that the probability of surviving forever is zero.

Why Candidates Get This Wrong

The most common first answer is: "The amoeba splits one-third of the time, so the population grows. Extinction cannot be certain." This argument is intuitive and wrong. Yes, there is a positive probability of growth at each step. But the branching process is not the same as a simple random walk with drift. Growth and extinction are not symmetric outcomes, and the random fluctuations in a branching process can compound in ways that lead to collapse even when the population is large.

To see why the intuition fails, consider what happens even when the population is large — say, 1,000 amoebas. In the next generation, some die, some stay, some split. The population has a random walk-like dynamic with mean zero drift (since the mean offspring is exactly 1). But a random walk with zero drift, starting at any positive value, will hit zero in finite time with probability 1. The population behaves exactly like such a walk, and "hitting zero" is extinction.

The second common wrong answer is: "The expected population size is constant (since mean offspring = 1), so the population is a martingale, and by the martingale convergence theorem, it converges to some positive limit." This is also wrong, and the error is subtle. A non-negative martingale converges almost surely to a non-negative limit, but that limit may be zero — indeed, for branching processes in the critical case, the limiting distribution assigns probability 1 to the value zero. The martingale convergence theorem guarantees convergence, not that the limit is positive.

Let us compute the mean offspring explicitly before proceeding to the proof:

\[\mu = 0 \cdot \frac{1}{3} + 1 \cdot \frac{1}{3} + 2 \cdot \frac{1}{3} = \frac{0 + 1 + 2}{3} = 1\]

The mean offspring per amoeba is exactly 1. This is called the critical case in branching process theory, and it is precisely the case where the result — certain extinction — is most counterintuitive. When the mean is less than 1, extinction is obviously expected (the population is shrinking on average). When the mean exceeds 1, extinction may or may not occur, and the extinction probability depends on the full distribution. But when the mean is exactly 1, extinction is guaranteed — and the proof requires the fixed-point algebra we are about to develop.

Setting Up the Fixed-Point Equation

Let \(p\) denote the probability that the entire population eventually goes extinct, starting from a single amoeba. This probability is well-defined and satisfies \(0 \leq p \leq 1\). We derive an equation for \(p\) by conditioning on what happens in the first minute — the first generation — and applying the law of total probability.

In the first minute, exactly one of three mutually exclusive events occurs:

Summing the contributions from all three cases:

\[p = \frac{1}{3} + \frac{1}{3}p + \frac{1}{3}p^2\]

This is the fixed-point equation for the extinction probability. It says that \(p\) must satisfy this particular algebraic relationship — and any valid extinction probability must be a root of this equation that lies in \([0, 1]\). The extinction probability is self-consistent: conditioning on the first step and using the recursive structure of the branching process recovers the same probability \(p\).

Multiplying through by 3:

\[3p = 1 + p + p^2\] \[p^2 - 2p + 1 = 0\] \[(p - 1)^2 = 0\]
Result

Extinction is certain. Starting from a single amoeba following this three-outcome process, the probability that the population eventually reaches zero is exactly 1 — even though the expected population size at any time \(t\) is constant. The population is a martingale that converges almost surely to zero.

Solving the Quadratic

The quadratic \((p-1)^2 = 0\) has a single root at \(p = 1\), with multiplicity 2. There is no ambiguity in root selection: the only solution in \([0,1]\) is \(p = 1\). This is not an approximation and not a limiting value — it is the exact algebraic answer.

The fact that \(p = 1\) is a repeated root has geometric significance. The probability generating function of the offspring distribution is \(G(s) = \frac{1}{3} + \frac{1}{3}s + \frac{1}{3}s^2\). The extinction probability is the fixed point of \(G\), meaning the smallest non-negative solution to \(G(s) = s\). At \(s = 1\), we have \(G(1) = 1\) trivially (generating functions always satisfy \(G(1) = 1\) when the offspring distribution is proper). The extinction probability equals 1 precisely when \(G\) is tangent to the identity line at \(s = 1\), which happens exactly when \(G'(1) = \mu = 1\). This tangency — the generating function touching rather than crossing the diagonal — is the geometric signature of the critical branching process.

The contrast with the supercritical case is instructive. Suppose the probabilities were different: death probability 0.2, survival probability 0.3, and splitting probability 0.5. Then:

\[p = 0.2 + 0.3p + 0.5p^2\] \[0.5p^2 - 0.7p + 0.2 = 0\] \[p^2 - 1.4p + 0.4 = 0\] \[p = \frac{1.4 \pm \sqrt{1.96 - 1.6}}{2} = \frac{1.4 \pm \sqrt{0.36}}{2} = \frac{1.4 \pm 0.6}{2}\]

This gives two roots: \(p = 1.0\) and \(p = 0.4\). The mean offspring in this scenario is \(\mu = 0(0.2) + 1(0.3) + 2(0.5) = 1.3 > 1\). For a supercritical branching process (\(\mu > 1\)), the extinction probability is the smaller root of the fixed-point equation — here \(p = 0.4\). The population goes extinct with probability 40% and survives forever with probability 60%. This is the generic supercritical outcome: extinction is possible but not certain, and the exact probability is the unique solution in \([0, 1)\).

Why do we take the smaller root in the supercritical case? Because we want the smallest non-negative fixed point of the generating function \(G\). When \(\mu > 1\), the function \(G(s)\) crosses the diagonal at some \(q \in (0, 1)\) before the trivial fixed point at \(s = 1\). The crossing at \(q\) is the genuine extinction probability; the trivial fixed point at 1 corresponds to the probability of eventual extinction or survival, which is trivially 1 since those two events cover all possibilities. The biology selects the smallest fixed point.

The General Branching Process Theorem

The amoeba problem is an instance of the Galton-Watson branching process, named after Francis Galton and Henry Watson who developed the theory in the 1870s while studying the extinction of family surnames in Victorian England — a problem mathematically identical to amoeba extinction. The general theorem is among the most elegant in probability theory.

Let \(Z_n\) denote the population size in generation \(n\), starting with \(Z_0 = 1\). Each individual in generation \(n\) independently produces a random number of offspring in generation \(n+1\) according to a fixed offspring distribution with probabilities \(\{p_k\}_{k=0}^\infty\), where \(p_k = P(\text{offspring count} = k)\). The mean offspring is \(\mu = \sum_{k=0}^\infty k \cdot p_k\) and the probability generating function is \(G(s) = \sum_{k=0}^\infty p_k s^k\).

The Galton-Watson extinction theorem states:

The critical case (\(\mu = 1\)) is particularly striking. The population process \(\{Z_n\}_{n \geq 0}\) is a non-negative martingale — we can verify this directly: \(E[Z_{n+1} | Z_n] = Z_n \cdot \mu = Z_n \cdot 1 = Z_n\). By the martingale convergence theorem, it converges almost surely to a limit \(Z_\infty \geq 0\). The content of the extinction theorem is that this limit satisfies \(P(Z_\infty = 0) = 1\). The population does converge — to zero. The path to zero can be arbitrarily long; the population may grow for many generations before ultimately collapsing. But the collapse is certain.

The intuition, made rigorous by the theory, is that variance accumulates over generations. Even with zero mean drift, the fluctuations in the branching process grow over time (the variance of \(Z_n\) grows linearly in \(n\) for the critical case), and this increasing dispersion, combined with the absorbing barrier at zero, guarantees eventual absorption. The population wanders further and further from its starting point, but the absorbing state at zero captures it eventually with probability 1.

Case Mean Offspring μ Extinction Probability q Interpretation
Subcritical \(\mu < 1\) \(q = 1\) Population shrinks on average; certain extinction
Critical \(\mu = 1\) \(q = 1\) Zero-drift martingale; still certain extinction (our problem)
Supercritical \(\mu > 1\) \(q \in (0, 1)\) Smallest fixed point of G(s) = s; non-trivial survival probability

Python Simulation: Watching Populations Collapse

The simulation below runs up to 10,000 generations per trial, capping runaway populations at 10,000 to prevent memory exhaustion. With these parameters, the empirical extinction probability consistently falls between 0.96 and 0.99 — approaching but not reaching 1.0, because the simulation uses a finite time horizon whereas the mathematical result requires an infinite one. The gap between the simulated value and the true value of 1.0 represents the probability of populations that survive more than 10,000 generations — a small but nonzero number.

Python amoeba_extinction.py
import random
from typing import List


def simulate_generation(population: int) -> int:
    """Evolve one generation of amoebas.

    Each amoeba independently:
      - Dies (outcome 0)     with probability 1/3
      - Survives (outcome 1) with probability 1/3
      - Splits (outcome 2)   with probability 1/3

    Returns the next generation population size.
    """
    next_pop = 0
    for _ in range(population):
        outcome = random.randint(0, 2)
        if outcome == 1:      # survive unchanged
            next_pop += 1
        elif outcome == 2:   # split into two
            next_pop += 2
        # outcome == 0: die — contribute 0 to next generation
    return next_pop


def simulate_extinction(max_generations: int = 10_000) -> bool:
    """Run one trial. Returns True if population goes extinct within max_generations."""
    population = 1
    for _ in range(max_generations):
        if population == 0:
            return True
        if population > 10_000:    # cap runaway populations for memory safety
            return False
        population = simulate_generation(population)
    return population == 0


def estimate_extinction_probability(n_trials: int = 5_000) -> float:
    """Estimate the extinction probability from n_trials independent simulations."""
    extinctions = sum(simulate_extinction() for _ in range(n_trials))
    return extinctions / n_trials


random.seed(42)
p_empirical = estimate_extinction_probability()
print(f"Empirical P(extinction) = {p_empirical:.4f}")
print(f"Mathematical result:      1.0000")
print(f"Gap (finite-horizon artifact): {1.0 - p_empirical:.4f}")

# Trace a few sample trajectories to illustrate the collapse
print("\nSample population trajectories (first 20 generations):")
for trial in range(5):
    pop = 1
    trajectory = [pop]
    for _ in range(20):
        if pop == 0:
            trajectory.append(0)
            continue
        pop = simulate_generation(pop)
        trajectory.append(pop)
    print(f"  Trial {trial + 1}: {trajectory}")

The population trajectories reveal the core dynamics of the critical branching process. Some trials collapse immediately in the first generation when the single amoeba dies. Others grow for several generations — reaching populations of 10, 50, or even several hundred — before the random fluctuations eventually drive them to zero. This is what makes the critical case counterintuitive: you can observe the population growing for a long time and still be on a path toward certain eventual extinction. The growth is real but temporary; the collapse is certain but may be distant.

Note the caveat about the finite-horizon simulation: the empirical extinction probability will be approximately 0.97 or 0.98, not 1.0. The remaining 2–3% of simulated trials represent populations that exceeded the 10,000-generation limit or the 10,000-amoeba cap without going extinct. These are genuine non-extinction paths in the simulation, but the mathematical theorem guarantees they would eventually collapse given infinite time. The simulation is a useful sanity check, but it cannot prove the mathematical result — only the algebra of the fixed-point equation can do that.

Business Application: Default Cascades and Contagion Risk

The Galton-Watson branching process is a foundational model for contagion — the spread of a disturbance through a network where each affected node triggers additional affected nodes, each of which may trigger still more. This structure appears throughout financial markets, supply chains, and epidemic modeling, and the extinction probability theorem gives a precise criterion for whether contagion will die out or propagate systemically.

In credit markets, a defaulting firm does not always default in isolation. Suppliers that depended on the firm for revenue may themselves face cash flow disruption and default. Those suppliers' suppliers may do the same. Each default "reproduces" into a random number of additional defaults — the number depending on the firm's position in the production network, the severity of the cash flow shock, and the credit quality of its counterparties. When the mean branching factor — the expected number of additional defaults triggered by each default — is less than 1, contagion dies out quickly. When it exceeds 1, cascades can propagate to arbitrary scale.

The 2008 financial crisis can be understood, at least partially, through this lens. The interconnection of mortgage-backed securities meant that a single wave of mortgage defaults could trigger losses at banks that held those securities, which could trigger counterparty defaults at firms that had entered into credit default swaps with those banks, which could trigger liquidity crises at funds that relied on those firms for financing. The branching factor of this network, under normal conditions, was subcritical — contagion was self-limiting. Under the stress of the housing collapse, it became briefly supercritical, and the resulting cascade required extraordinary government intervention to interrupt.

The same framework applies to supply chain disruptions. A natural disaster that incapacitates a key semiconductor manufacturer (node zero in the branching process) may force automotive manufacturers who depend on that supplier to halt production, which may delay deliveries to dealerships, which may affect floor plan financing arrangements. The branching factor of this supply chain network determines whether the disruption propagates globally or dies out locally. Recent work on supply chain resilience focuses precisely on identifying and reducing the branching factor of critical nodes — reducing connectivity and building buffer inventory to drive the effective reproduction number below 1, the threshold for subcritical (self-limiting) contagion.

The amoeba extinction problem, with its clean three-outcome setup and quadratic fixed-point equation, is the canonical minimal example of this entire family of models. Understanding the proof — why the critical case yields certain extinction, why the generating function tangency at \(s = 1\) matters, and why variance accumulates to drive the zero-drift martingale to zero — is prerequisite knowledge for anyone working with contagion models in finance, epidemiology, or network science.

Need Stochastic Modeling for Risk or Credit?

We build branching process models, Monte Carlo simulations, and probabilistic risk frameworks for financial institutions and operators who need defensible answers under uncertainty.

Talk to Our Team