Solution

ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2011/b/6/a/solution

A Galton-Watson process starts with one ancestor, . Given generation size , define
where all offspring variables are independent with common distribution . The empty sum is zero, so zero is absorbing. Its extinction probability is
For the probability generating function , the allowed fixed-point characterization is
For binomial offspring, , with , , and convex on .
First assume . If , extinction occurs immediately. For , for , so the only fixed point is one. For , strict convexity gives
If , the right-hand side is at least , so no fixed point below one exists and . If , for just below one, whereas . Continuity supplies a fixed point in ; hence . Thus in the nondegenerate parameter range,
For completeness, if binomial endpoint parameters are allowed, or gives , while and gives deterministic positive offspring and . In particular survives forever despite mean one. Over and , the full condition is

New to topics? Read the docs here!