Population growth: Galton-Watson process. Population growth: Galton-Watson process. A simple branching process. A simple branching process

Similar documents
Extinction of Family Name. Student Participants: Tianzi Wang Jamie Xu Faculty Mentor: Professor Runhuan Feng

Modern Discrete Probability Branching processes

4 Branching Processes

CASE STUDY: EXTINCTION OF FAMILY NAMES

Sections 8.1 & 8.2 Systems of Linear Equations in Two Variables

Theory of Stochastic Processes 3. Generating functions and their applications

6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes

A NOTE ON THE ASYMPTOTIC BEHAVIOUR OF A PERIODIC MULTITYPE GALTON-WATSON BRANCHING PROCESS. M. González, R. Martínez, M. Mota

Hitting Probabilities

Sharpness of second moment criteria for branching and tree-indexed processes

Branching within branching: a general model for host-parasite co-evolution

Branching processes. Chapter Background Basic definitions

Limiting distribution for subcritical controlled branching processes with random control function

Chapter 6: Branching Processes: The Theory of Reproduction

3.4 Using the First Derivative to Test Critical Numbers (4.3)

MAT137 Calculus! Lecture 45

Lecture 2: Tipping Point and Branching Processes

14 Branching processes

MATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS

BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES

Homework 6: Solutions Sid Banerjee Problem 1: (The Flajolet-Martin Counter) ORIE 4520: Stochastics at Scale Fall 2015

UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES

Today s Agenda. Upcoming Homework Section 2.1: Derivatives and Rates of Change

Survival Probabilities for N-ary Subtrees on a Galton-Watson Family Tree

1 Informal definition of a C-M-J process

Directional Derivatives and Gradient Vectors. Suppose we want to find the rate of change of a function z = f x, y at the point in the

For a function f(x) and a number a in its domain, the derivative of f at a, denoted f (a), is: D(h) = lim

On the behavior of the population density for branching random. branching random walks in random environment. July 15th, 2011

Lecture 06 01/31/ Proofs for emergence of giant component

Limits and the derivative function. Limits and the derivative function

BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON

2. Transience and Recurrence

MATH 241 FALL 2009 HOMEWORK 3 SOLUTIONS

RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS

Branching, smoothing and endogeny

Homework 3 posted, due Tuesday, November 29.

Tangent Lines and Derivatives

A CS look at stochastic branching processes

1.2 Functions What is a Function? 1.2. FUNCTIONS 11

WXML Final Report: Chinese Restaurant Process

Determining the Intervals on Which a Function is Increasing or Decreasing From the Graph of f

Solutions to homework Assignment #6 Math 119B UC Davis, Spring 2012

Mathematical modelling Chapter 2 Nonlinear models and geometric models

Quasi-stationary distributions

arxiv: v2 [math.pr] 7 Oct 2016

FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES

P (A G) dp G P (A G)

LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE. S. Kurbanov

Macroscopic quasi-stationary distribution and microscopic particle systems

Maria Cameron. f(x) = 1 n

Generating Functions. STAT253/317 Winter 2013 Lecture 8. More Properties of Generating Functions Random Walk w/ Reflective Boundary at 0

First order logic on Galton-Watson trees

THE NOISY VETO-VOTER MODEL: A RECURSIVE DISTRIBUTIONAL EQUATION ON [0,1] April 28, 2007

SYSTEMS OF NONLINEAR EQUATIONS

Taylor and Maclaurin Series. Approximating functions using Polynomials.

(Ω, F, P) Probability Theory Kalle Kyt ol a 1

Metapopulations with infinitely many patches

Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods

Fixed point iteration Numerical Analysis Math 465/565

Calculus and Parametric Equations

Elementary Applications of Probability Theory

Yaglom-type limit theorems for branching Brownian motion with absorption. by Jason Schweinsberg University of California San Diego

Math 1314 Week #14 Notes

Exam Stochastic Processes 2WB08 - March 10, 2009,

A stochastic representation for the Poisson-Vlasov equation

Math 2414 Activity 1 (Due by end of class Jan. 26) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line.

ExtremeValuesandShapeofCurves

Course Notes. Part IV. Probabilistic Combinatorics. Algorithms

1) Which form is best when asked to determine the values of x for which the expression is undefined, equal to zero, positive or negative? Why?

Erdős-Renyi random graphs basics

Example: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected

arxiv: v1 [math.pr] 13 Nov 2018

2. Theory of the Derivative

Math 2414 Activity 1 (Due by end of class July 23) Precalculus Problems: 3,0 and are tangent to the parabola axis. Find the other line.

A Note on Bisexual Galton-Watson Branching Processes with Immigration

MTH 202 : Probability and Statistics

Stochastic Gradient Descent in Continuous Time

Grade 12 (MCV4UE) AP Calculus Page 1 of 5 Derivative of a Function & Differentiability

9.1 Branching Process

Hard-Core Model on Random Graphs

Spectral thresholds in the bipartite stochastic block model

SOLUTIONS OF SEMILINEAR WAVE EQUATION VIA STOCHASTIC CASCADES

BROWN UNIVERSITY MATH 0350 MIDTERM 19 OCTOBER 2017 INSTRUCTOR: SAMUEL S. WATSON. a b. Name: Problem 1

2.7: Derivatives and Rates of Change

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.

Technical Calculus I Homework. Instructions

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

De los ejercicios de abajo (sacados del libro de Georgii, Stochastics) se proponen los siguientes:

(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);

Euler s Method and Logistic Growth (BC Only)

Stochastic modelling of epidemic spread

On the Torsion Subgroup of an Elliptic Curve

Notes 1 : Measure-theoretic foundations I

Crump Mode Jagers processes with neutral Poissonian mutations

Math 1120 Calculus, sections 3 and 10 Test 1

Can evolution paths be explained by chance alone? arxiv: v1 [math.pr] 12 Oct The model

is the intuition: the derivative tells us the change in output y (from f(b)) in response to a change of input x at x = b.

AP Calculus BC. Chapter 2: Limits and Continuity 2.4: Rates of Change and Tangent Lines

Slopes and Rates of Change

Transcription:

Population growth: Galton-Watson process Population growth: Galton-Watson process Asimplebranchingprocess September 27, 2013 Probability law on the n-th generation 1/26 2/26 A simple branching process A simple branching process Let us consider a simple stochastic model for the evolution of the size of a population. (a) The population evolves in generations. Let Z k be the number of members of the k-th generation. By assumption, Z 0 =1. (b) Each member of the k-th generation gives birth to a family, possibly empty, of members of the (k + 1)-th generation. I I The family sizes form a collection of independent and identically distributed random variables. The size of each of these families (i.e., the number of descendants of an individual) has probability function: Such a branching process {Z 0, Z 1,...,Z n,...} is called a Galton-Watson process. P( = i) =p i, i 0 3/26 4/26

Example Example Suppose, for instance, that Z 1 = 2. Then For instance, suppose that Then p 0 = 1 2, p 1 = 1 4, p 2 = 1 4 P(Z 2 =0 Z 1 = 2) = P( 1 + 2 = 0) = p 2 0 = 1 4 P(Z 2 =1 Z 1 = 2) = P( 1 + 2 = 1) = p 0 p 1 + p 1 p 0 = 1 4 P(Z 2 =2 Z 1 = 2) = P( 1 + 2 = 2) = p 0 p 2 + p 1 p 1 + p 2 p 0 = 5 16 P(Z 2 =3 Z 1 = 2) = P( 1 + 2 = 3) = p 1 p 2 + p 2 p 1 = 1 8 P(Z 1 = 0) = 1 2, P(Z 1 = 1) = 1 4, P(Z 1 = 2) = 1 4 P(Z 2 =4 Z 1 = 2) = P( 1 + 2 = 4) = p 2 2 = 1 16 Of course, we have P(Z 2 = n Z 1 = 2) = 1 n 0 5/26 6/26 Example Probability distribution of Z k+1 Performing similar calculations and taking into account that P(Z 2 = n) = 2 P(Z 2 = n Z 1 = r)p(z 1 = r) r=0 we obtain the probability function of Z 2 : P(Z 2 = 0) = 11 16, P(Z 2 = 1) = 2 16, P(Z 2 = 2) = 9 64, P(Z 2 = 3) = 1 32, P(Z 2 = 4) = 1 64 In general, P(Z k+1 = n Z k = r) =P( 1 + 2 + + r = n), where the r.v. i are independent and identically distributed as. Of course, P(Z k+1 =0 Z k = 0) = 1 By the TPT, P(Z k+1 = n) = P(Z k+1 = n Z k = r)p(z k = r) r 0 7/26 8/26

Extinction probabilities Extinction probabilities Let us calculate the probability that the population disappears in a number of generations apple m, d m P(Z m = 0) Let D m = {Z m =0}. Then d m = P(D m ) = P(D m Z 1 = k)p(z 1 = k) = m 1 ) k 0 k 0(d k P( = k) In the previous example, d 0 =0 d 1 = 1 2 d 2 = 11 16 Hence, if G (s) = s k P( = k) k 0 is the probability generating function of,then d m = G (d m 1 ) 9/26 10 / 26 Extinction probabilities In our example, Hence d 0 =0 G (s) = 1 2 + 1 4 s + 1 4 s2 d 1 = G (d 0 )=G (0) = 1 2 1 d 2 = G (d 1 )=G = 1 2 2 + 1 4 1 2 + 1 1 2 4 = 11 2 16 11 d 3 = G (d 3 )=G = 1 16 2 + 1 4 11 16 + 1 11 2 4 = 809 16 1024 Notice that d 0 apple d 1 apple d 2 apple apple d m apple apple 1 Hence the following limit exists: What is its meaning? d lim m!1 d m 11 / 26 12 / 26

We have D 0 D 1 D m D m+1 Therefore we can consider the limit event D = lim m!1 D m = 1[ D k, k=0 which corresponds to the ultimate extinction of the population. Hence d = lim d m = lim P(D m)=p lim D m m!1 m!1 m!1 = P(D) From d m = G (d m 1 ) we get that (m!1): d = G (d) I So, the extinction probability d is a solution of the equation s = G (s) I Notice that s =1is always a root. is the probability of that ultimate extinction. 13 / 26 14 / 26 Returning to the example, s = G (s) () s = p 0 + p 1 s + p 2 s 2 (1) Case m < 1 () p 0 > p 2 () s 2 > 1 2.5 Hence The two roots are p 2 s 2 (p 0 + p 2 ) s + p 0 =0 s 1 =1, s 2 = p 0 p 2 2.0 1.5 1.0 0.5 0.5 1.0 1.5 2.0 2.5 Let m be the expected number of descendants per individual: m =E( )=p 1 +2p 2 =1 p 0 + p 2 Figure: p 0 =1/2, p 1 =1/4, p 2 =1/4 The iterations d m = G (d m 1 ) converge to d = 1. 15 / 26 16 / 26

(2) Case m =1() p 0 = p 2 () s 1 = s 2 =1 (3) Case m > 1 () p 0 < p 2 () s 2 < 1 2.0 1.5 1.5 1.0 1.0 0.5 0.5 0.5 1.0 1.5 2.0 0.2 0.4 0.6 0.8 1.0 1.2 1.4 Figure: p 0 =1/4, p 1 =1/2, p 2 =1/4 Figure: p 0 =1/4, p 1 =1/4, p 2 =1/2 The iterations d m = G (d m 1 ) also converge to d = 1. The iterations d m = G (d m 1 ) converge to d = s 2 < 1. 17 / 26 18 / 26 General case General case The same analysis can be done in a more general situation. Notice that if s 0, then G (s) = p 0 + p 1 s + p 2 s 2 + p 3 s 3 + 0 G 0 (s) = p 1 +2p 2 s +3p 3 s 2 + 0 G 00 (s) =2p 2 +6p 3 s + 0 So, the plot of G (s) is as in the case of a polynomial of degree 2. I In general, the plot of G (s) will intersect in two points the line (with equation) s. So, the equation s = G (s) willhave two solutions. I The iterations d m = G (d m 1 ) will converge to the smallest of the two solutions. I Moreover, m =E( )=G 0 (1) is the slope of the tangent line of G (s) ats = 1. I Hence we have again the three cases considered above for G a polynomial of degree 2. 19 / 26 20 / 26

Probability generating function of Z n Theorem Let d be the smallest root of the equation s = G (s) and let m =E( ). Then d is the probability of ultimate extinction of the population. Moreover, I m < 1 ) d =1. The extinction is sure. I m =1) The line s is tangent at s =1to G (s) (double root d =1). The extinction is sure. I m > 1 ) d < 1. In this case, there is a positive probability 1 d > 0 of non-extinction. Let G n (s) the probability generating function of Z n. We have G n+1 (s) =E Moreover, E s Z n+1 = E s Z n+1 Z n = k P(Z n = k) k 0 s Z n+1 Z n = k =E s 1+ 2 + + k Z n = k =E s 1+ 2 + + k = E s k =(G (s)) k 21 / 26 22 / 26 Probability generating function of Z n Probability generating function of Z n Therefore Recall that Then G n+1 (s) = k 0 (G (s)) k P(Z n = k) G n (z) = k 0 z k P(Z n = k) G n+1 (s) =G n (G (s)) So, we have G 1 (s) =G (s) G 2 (s) =G 1 (G (s)) = G (G (s)) = G (2) (s) G 3 (s) =G 2 (G (s)) = G (G (G (s))) = G (3) (s) G n (s) =G n 1 (G (s)) = G (G ( G (s) )) = G (n) (s) 23 / 26 24 / 26

Probability generating function of Z n Expected number of individuals In the example, G (s) = 1 2 + 1 4 s + 1 4 s2 Let m n =E(Z n ). The derivative of G n+1 (s) =G n (G (s)) is Then G 2 (s) =G (G (s)) = 1 2 + 1 4 G (s)+ 1 4 (G (s)) 2 = 1 2 + 1 4 1 2 + 1 4 s + 1 4 s2 + 1 1 4 2 + 1 4 s + 1 2 4 s2 = 11 16 + 1 8 s + 9 64 s2 + 1 32 s3 + 1 64 s4 Gn+1(s) 0 =Gn 0 (G (s)) G 0 (s) Taking s =1wehave Gn+1(1) 0 = Gn 0 (G (1)) G 0 (1) = G n 0 (1) G 0 (1) Hence m n+1 = m n m.therefore m n = m n 25 / 26 26 / 26