Probabilistic proof for non-survival at criticality : the Galton-Watson process and more
Olivier Garet (IECL)

TL;DR
This paper introduces a probabilistic proof technique for non-survival at criticality, exemplified through the Galton-Watson process and extended to a cooperative reproductive model, emphasizing intuitive probabilistic reasoning over classical analytic methods.
Contribution
It presents a probabilistic proof approach for non-survival at criticality, offering a more intuitive alternative to traditional analytic proofs, and extends the analysis to cooperative reproduction models.
Findings
Galton-Watson process survival only if fertility exceeds 1
Probabilistic proof method aligns with intuitive understanding
Survival in cooperative models depends on reproductive interactions
Abstract
In a famous paper, Bezuidenhout and Grimmett demonstrated that the contact process dies out at the critical point.Their proof technique has often been used to study the growth of population patterns. The present text is intended as an introduction to their ideas, with examples of minimal technicality. In particular, we recover the basic theorem about Galton-Watson chains: except in a degenerate case, survival is possible only if the fertility rate exceeds 1. The classical proof that is taught in classrooms is essentially analytic, based on generating functions and convexity arguments. Following the Bezuidenhout-Grimmett way, we propose a proof that is more consistent with probabilistic intuition. We also study the survival problem for a cooperative model, mixing sexual and asexual reproduction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Evolutionary Game Theory and Cooperation · Evolution and Genetic Dynamics
