Explore the individuals one at a time, maintaining the number of discovered but unprocessed individuals. It starts at . Processing one individual removes it and adds its offspring, so
The offspring choices make these increments independent. Exploration stops when the queue first becomes empty; every processed individual has then been counted exactly once. Hence
with if the walk never hits zero. The increment sequence can be extended independently beyond the stopping time for probability estimates.
The event implies . If counts the positive increments, then and . Let .
For , forces , so the lower-tail Hoeffding form of the Chernoff bound gives
For and , the required value is at least . The upper-tail bound gives .
To include all smaller positive integers, note that each finite-time atom has probability strictly less than one: at its probability is , while for immediate extinction already has positive probability and excludes . Over the finitely many small with nonzero atom, take the minimum of and the applicable tail constant. This minimum is positive, and zero atoms impose no restriction. Thus for both cases there is such that
In the supercritical case this bounds the finite atoms, not the positive probability of .
Let be the size of generation , with . Its offspring mean is , so conditioning on the previous generation gives . At ,
The interchange uses Tonelli's theorem for nonnegative variables. Critical extinction is nevertheless almost sure: its probability is the smallest root in of , whose only root is one. Hence is finite almost surely. If all its finite atoms had the exponential bound, then , a contradiction.
For the extinction probability is . There is positive mass at , so the mean is infinite even if every finite atom decays exponentially. This is precisely why the critical contradiction does not extend to the supercritical case.

Articles by others on the same topic (0)

There are currently no matching articles.