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

Size: px
Start display at page:

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

Transcription

1 Branching within branching: a general model for host-parasite co-evolution Gerold Alsmeyer (joint work with Sören Gröttrup) May 15, 2017 Gerold Alsmeyer Host-parasite co-evolution 1 of 26

2 1 Model 2 The associated branching process in random environment (ABPRE) 3 Extinction results 4 Limit theorems in the case of survival Gerold Alsmeyer Host-parasite co-evolution 2 of 26

3 Model description The basic ingredients a cell population (the hosts) a population of parasites colonizing the cells The basic assumptions cells form an ordinary Galton-Watson tree (GWT) parasites sitting in different cells multiply and share their progeny into daughter cells independently, but for parasites hosted by the same cell v, offspring numbers and sharing of progeny are conditionally independent given the number of daughter cells of v Gerold Alsmeyer Host-parasite co-evolution 3 of 26

4 Notational details: the cell population Ulam-Harris tree V = n 0 N n with N 0 = { } cell population: a GWT T = n N 0 T n V with T 0 = { } and T n := {v 1 v n V v 1 v n 1 T n 1 and 1 v n N v1 v n 1 }, where N v denotes the number of daughter cells of v the N v, v V are iid with common law (p k ) k 0, the offspring distribution of cells, having finite mean ν = k 1 kp k the number of cells process: T n = v Tn 1 N v (a GWP) Gerold Alsmeyer Host-parasite co-evolution 4 of 26

5 Details: the parasites the number of parasites in cell v are denoted by Z v the number of parasites process is then defined by Z n := v T n Z v, n N 0 the set of contaminated cells: T n = {v T n : Z v > 0} the number of contaminated cells: T n = #T n cell counts with a specific number of parasites: T n := ( T n,0,t n,1,t n,2, ), where T n,k gives the number of cells in generation n hosting k parasites Gerold Alsmeyer Host-parasite co-evolution 5 of 26

6 Z =1 Z 0 Z 1 =2 Z 2 =4 Z 3 =1 Z 1 Z 11 =3 Z 12 =1 Z 31 =0 Z 32 =5 Z 33 =2 Z 2 Figure: A typical realization of the first three generations of a BwBP Gerold Alsmeyer Host-parasite co-evolution 6 of 26

7 Reproduction of parasites To describe reproduction of parasites consider those hosted by a cell v T and suppose that Z v = z 1 and that v has k daughter cells, labeled v1,,vk, thus N v = k For i = 1,,z, let X (,k) i,v := ( X (1,k) i,v ),,X (k,k) i,v be iid copies of a random vector X (,k) := ( X (1,k),,X (k,k)) with arbitrary law on N k 0 and independent of any other occurring rv s Then, given N v = k, and for i = 1,,Z v = z, X (j,k) i,v equals the number of offspring of the i th parasite in v that is shared into daughter cell vj Gerold Alsmeyer Host-parasite co-evolution 7 of 26

8 Model parameters and basic assumptions µ j,k = EX (j,k) γ = EZ 1 = k 1 p k k j=1 µ j,k, the mean number of offspring per parasite, is supposed to be positive and finite, thus µ j,k < for all j k and P(N v = 0) < 1 We further assume p 1 = P(N v = 1) < 1, P(Z 1 = 1) < 1, and a positive chance for more than one parasite to be shared in the same daughter cell: p k P(X (j,k) 2) > 0 for at least one (j,k), 1 j k Gerold Alsmeyer Host-parasite co-evolution 8 of 26

9 A very short list of earlier contributions M Kimmel Quasistationarity in a branching model of division-within-division In Classical and modern branching processes (Minneapolis, MN, 1994), volume 84 of IMA Vol Math Appl, pages Springer, New York, 1997 V Bansaye Proliferating parasites in dividing cells: Kimmel s branching model revisited Ann Appl Probab, 18(3): , 2008 G Alsmeyer and S Gröttrup A host-parasite model for a two-type cell population Adv in Appl Probab, 45(3): , 2013 Gerold Alsmeyer Host-parasite co-evolution 9 of 26

10 The notorious questions Extinction-explosion dichotomy for the number of parasites process (Z n ) n 0 Extinction-explosion dichotomy for the number of contaminated cells process (T n ) n 0 {Z n } = {T n }? Necessary and sufficient conditions for almost sure extinction of contaminated cells Limit theorems for the relevant processes in the survival case (after normalization) Gerold Alsmeyer Host-parasite co-evolution 10 of 26

11 The ABPRE The associated branching process in random environment (ABPRE) is obtained by picking an infinite random cell-line (spine) in a size-biased version of T: Gerold Alsmeyer Host-parasite co-evolution 11 of 26

12 The construction (standard) Let (T n,c n ) n 0 be a sequence of iid random vectors independent of (N v ) v V and (X (,k) i,v ) k 1,i 1,v V The law of T n equals the size-biasing of the law of the N v, ie P(T n = k) = kp k ν for each n N 0 and k N, and P(C n = j T n = k) = 1 k for 1 j k, which means that C n has a uniform distribution on {1,,k} given T n = k Gerold Alsmeyer Host-parasite co-evolution 12 of 26

13 The ABPRE The random cell-line (spine) (V n ) n 0 is then recursively defined by V 0 = and V n := V n 1 C n 1 for n 1 Then =: V 0 V 1 V 2 V n provides us with a random cell line in V (not picked uniformly) as depicted in the following picture Gerold Alsmeyer Host-parasite co-evolution 13 of 26

14 The ABPRE V 0 BP 0 V 1 BP 1 V 2 BP 2 V 3 Gerold Alsmeyer Host-parasite co-evolution 14 of 26

15 The number of parasites along the spine Regarding the structure of the number of parasites process along the spine (Z Vn ) n 0, the following lemma is fundamental Lemma Let (Z n) n 0 be a BPRE with Z ancestors and iid environmental sequence Λ := (Λ n ) n 0 taking values in {L (X (j,k) ) 1 j k < } and such that ( ) P Λ 0 = L (X (j,k) ) = p k ν = 1 k kp k ν = P(C 0 = j,t 0 = k) for all 1 j k < Then (Z Vn ) n 0 and (Z n) n 0 are equal in law Gerold Alsmeyer Host-parasite co-evolution 15 of 26

16 Definition of the ABPRE The BPRE (Z n) n 0 is now called the associated branching process in random environment (ABPRE) It is one of the major tools used in the study of the BwBP, and the following lemma provides a key relation between this process and its associated ABPRE Gerold Alsmeyer Host-parasite co-evolution 16 of 26

17 A key result Lemma For all n,k,z N 0, and P z ( Z n = k ) = ν n E z T n,k P z ( Z n > 0 ) = ν n E z T n Gerold Alsmeyer Host-parasite co-evolution 17 of 26

18 Generating functions For n N and s [0,1] E(s Z n Λ) = g Λ0 g Λn 1 (s) is the quenched generating function of Z n with iid g Λn and g λ defined by g λ (s) := E(s Z 1 Λ0 = λ) = λ n s n n 0 for any distribution λ = (λ n ) n 0 on N 0 Moreover, Eg Λ 0 (1) = EZ 1 = where γ = EZ 1 p k ν EX (j,k) = EZ 1 ν 1 j k = γ ν <, (1) Gerold Alsmeyer Host-parasite co-evolution 18 of 26

19 Regimes of the ABPRE It is well-known that (Z n) n 0 survives with positive probability iff Elogg Λ 0 (1) > 0 and Elog (1 g Λ0 (0)) < Recall that γ < is assumed and that there exists 1 j k < such that p k > 0 and P(X (j,k) 1) > 0, which ensures that Λ 0 δ 1 with positive probability The ABPRE is called supercritical, critical or subcritical if Elogg Λ 0 (1) > 0, = 0 or < 0, respectively Gerold Alsmeyer Host-parasite co-evolution 19 of 26

20 Regimes of the ABPRE The subcritical case further divides into the three subregimes when Eg Λ 0 (1)logg Λ 0 (1) < 0,= 0, or > 0, respectively, called strongly, intermediate and weakly subcritical case The quite different behavior of the process in each of the three subregimes is shown by the limit results derived in J Geiger, G Kersting, and V A Vatutin Limit theorems for subcritical branching processes in random environment Ann Inst H Poincaré Probab Statist, 39(4): , 2003 Gerold Alsmeyer Host-parasite co-evolution 20 of 26

21 Notation For s = (s 0,s 1,) N = { (x i ) i 0 N 0 x i > 0 finitely often } and z N 0, we use P s for probabilities conditioned upon the event that the initial generation consists of s k cells hosting exactly k parasites for k = 0,1,, ie T 0,k = s k for k = 0,1, P z for probabilities given that initially there is one cell which contains z parasites, ie N = 1 and Z = z P = P 1 Gerold Alsmeyer Host-parasite co-evolution 21 of 26

22 The number of parasites process Theorem (Extinction-explosion principle) The parasite population of a BwBP either dies out or explodes, ie for all s N = { (x i ) i 1 N 0 x i > 0 finitely often } P s (Z n 0) + P s (Z n ) = 1 Gerold Alsmeyer Host-parasite co-evolution 22 of 26

23 The number of contaminated cells process Theorem Let P(Surv) > 0 and P z := P z ( Surv) (a) If P 2 (T1 2) > 0, then P z(tn ) = 1 and thus Ext = {sup n 0 Tn < } P z -as for all z N (b) If P 2 (T1 2) = 0, then P z(tn = 1 fa n 0) = 1 for all z N Gerold Alsmeyer Host-parasite co-evolution 23 of 26

24 Almost sure extinction of contaminated cells Theorem (a) If P 2 (T 1 2) = 0, then P(Ext) = 1 if, and only if, ElogE(Z 1 N ) 0 or Elog P(Z 1 > 0 N ) = (b) If P 2 (T1 2) > 0, then the following statements are equivalent: (i) P(Ext) = 1 (ii) ETn 1 for all n N 0 (iii) sup n N0 ETn < (iv) ν 1, or ν > 1, Elogg Λ 0 (1) < 0 and inf 0 θ 1 Eg Λ 0 (1) θ 1 ν Gerold Alsmeyer Host-parasite co-evolution 24 of 26

25 A second size-biasing V 0 BP 0 V 1 BP 1 V 2 BP 2 V 3 Gerold Alsmeyer Host-parasite co-evolution 25 of 26

26 Want to know more? G Alsmeyer and S Gröttrup Branching within branching: a model for host-parasite co-evolution Stochastic Process Appl, 126(6): , 2016 Gerold Alsmeyer Host-parasite co-evolution 26 of 26

Branching within Branching

Branching within Branching Sören Gröttrup Branching within Branching A Stochastic Description of Host-Parasite Populations 203 Mathematik Branching within Branching A Stochastic Description of Host-Parasite Populations Inaugural-Dissertation

More information

THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES

THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES J. Appl. Prob. 35, 537 544 (1998) Printed in Israel Applied Probability Trust 1998 THE x log x CONDITION FOR GENERAL BRANCHING PROCESSES PETER OLOFSSON, Rice University Abstract The x log x condition is

More information

Modern Discrete Probability Branching processes

Modern Discrete Probability Branching processes Modern Discrete Probability IV - Branching processes Review Sébastien Roch UW Madison Mathematics November 15, 2014 1 Basic definitions 2 3 4 Galton-Watson branching processes I Definition A Galton-Watson

More information

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

Sharpness of second moment criteria for branching and tree-indexed processes Sharpness of second moment criteria for branching and tree-indexed processes Robin Pemantle 1, 2 ABSTRACT: A class of branching processes in varying environments is exhibited which become extinct almost

More information

Random trees and branching processes

Random trees and branching processes Random trees and branching processes Svante Janson IMS Medallion Lecture 12 th Vilnius Conference and 2018 IMS Annual Meeting Vilnius, 5 July, 2018 Part I. Galton Watson trees Let ξ be a random variable

More information

The range of tree-indexed random walk

The range of tree-indexed random walk The range of tree-indexed random walk Jean-François Le Gall, Shen Lin Institut universitaire de France et Université Paris-Sud Orsay Erdös Centennial Conference July 2013 Jean-François Le Gall (Université

More information

Branching, smoothing and endogeny

Branching, smoothing and endogeny Branching, smoothing and endogeny John D. Biggins, School of Mathematics and Statistics, University of Sheffield, Sheffield, S7 3RH, UK September 2011, Paris Joint work with Gerold Alsmeyer and Matthias

More information

Branching processes. Chapter Background Basic definitions

Branching processes. Chapter Background Basic definitions Chapter 5 Branching processes Branching processes arise naturally in the study of stochastic processes on trees and locally tree-like graphs. After a review of the basic extinction theory of branching

More information

Linear-fractional branching processes with countably many types

Linear-fractional branching processes with countably many types Branching processes and and their applications Badajoz, April 11-13, 2012 Serik Sagitov Chalmers University and University of Gothenburg Linear-fractional branching processes with countably many types

More information

arxiv:math/ v1 [math.pr] 5 Apr 2004

arxiv:math/ v1 [math.pr] 5 Apr 2004 To appear in Ann. Probab. Version of 9 September 994 psfig/tex.2-dvips Conceptual Proofs of L log L Criteria for Mean Behavior of Branching Processes By Russell Lyons, Robin Pemantle, and Yuval Peres arxiv:math/0404083v

More information

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

Lecture 06 01/31/ Proofs for emergence of giant component M375T/M396C: Topics in Complex Networks Spring 2013 Lecture 06 01/31/13 Lecturer: Ravi Srinivasan Scribe: Tianran Geng 6.1 Proofs for emergence of giant component We now sketch the main ideas underlying

More information

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

6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes 6.207/14.15: Networks Lecture 3: Erdös-Renyi graphs and Branching processes Daron Acemoglu and Asu Ozdaglar MIT September 16, 2009 1 Outline Erdös-Renyi random graph model Branching processes Phase transitions

More information

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

THE NOISY VETO-VOTER MODEL: A RECURSIVE DISTRIBUTIONAL EQUATION ON [0,1] April 28, 2007 THE NOISY VETO-VOTER MODEL: A RECURSIVE DISTRIBUTIONAL EQUATION ON [0,1] SAUL JACKA AND MARCUS SHEEHAN Abstract. We study a particular example of a recursive distributional equation (RDE) on the unit interval.

More information

Chapter 2 Galton Watson Trees

Chapter 2 Galton Watson Trees Chapter 2 Galton Watson Trees We recall a few eleentary properties of supercritical Galton Watson trees, and introduce the notion of size-biased trees. As an application, we give in Sect. 2.3 the beautiful

More information

CASE STUDY: EXTINCTION OF FAMILY NAMES

CASE STUDY: EXTINCTION OF FAMILY NAMES CASE STUDY: EXTINCTION OF FAMILY NAMES The idea that families die out originated in antiquity, particilarly since the establishment of patrilineality (a common kinship system in which an individual s family

More information

RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS

RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS Pliska Stud. Math. Bulgar. 16 (2004), 43-54 STUDIA MATHEMATICA BULGARICA RECENT RESULTS FOR SUPERCRITICAL CONTROLLED BRANCHING PROCESSES WITH CONTROL RANDOM FUNCTIONS Miguel González, Manuel Molina, Inés

More information

QUEUEING FOR AN INFINITE BUS LINE AND AGING BRANCHING PROCESS

QUEUEING FOR AN INFINITE BUS LINE AND AGING BRANCHING PROCESS QUEUEING FOR AN INFINITE BUS LINE AND AGING BRANCHING PROCESS VINCENT BANSAYE & ALAIN CAMANES Abstract. We study a queueing system with Poisson arrivals on a bus line indexed by integers. The buses move

More information

A Conceptual Proof of the Kesten-Stigum Theorem for Multi-type Branching Processes

A Conceptual Proof of the Kesten-Stigum Theorem for Multi-type Branching Processes Classical and Modern Branching Processes, Springer, New Yor, 997, pp. 8 85. Version of 7 Sep. 2009 A Conceptual Proof of the Kesten-Stigum Theorem for Multi-type Branching Processes by Thomas G. Kurtz,

More information

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

Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods Non-Parametric Bayesian Inference for Controlled Branching Processes Through MCMC Methods M. González, R. Martínez, I. del Puerto, A. Ramos Department of Mathematics. University of Extremadura Spanish

More information

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

Population growth: Galton-Watson process. Population growth: Galton-Watson process. A simple branching process. A simple branching process 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

More information

1 Informal definition of a C-M-J process

1 Informal definition of a C-M-J process (Very rough) 1 notes on C-M-J processes Andreas E. Kyprianou, Department of Mathematical Sciences, University of Bath, Claverton Down, Bath, BA2 7AY. C-M-J processes are short for Crump-Mode-Jagers processes

More information

UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES

UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES Applied Probability Trust 7 May 22 UPPER DEVIATIONS FOR SPLIT TIMES OF BRANCHING PROCESSES HAMED AMINI, AND MARC LELARGE, ENS-INRIA Abstract Upper deviation results are obtained for the split time of a

More information

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

Susceptible-Infective-Removed Epidemics and Erdős-Rényi random Susceptible-Infective-Removed Epidemics and Erdős-Rényi random graphs MSR-Inria Joint Centre October 13, 2015 SIR epidemics: the Reed-Frost model Individuals i [n] when infected, attempt to infect all

More information

Ancestor Problem for Branching Trees

Ancestor Problem for Branching Trees Mathematics Newsletter: Special Issue Commemorating ICM in India Vol. 9, Sp. No., August, pp. Ancestor Problem for Branching Trees K. B. Athreya Abstract Let T be a branching tree generated by a probability

More information

The Contour Process of Crump-Mode-Jagers Branching Processes

The Contour Process of Crump-Mode-Jagers Branching Processes The Contour Process of Crump-Mode-Jagers Branching Processes Emmanuel Schertzer (LPMA Paris 6), with Florian Simatos (ISAE Toulouse) June 24, 2015 Crump-Mode-Jagers trees Crump Mode Jagers (CMJ) branching

More information

ON COMPOUND POISSON POPULATION MODELS

ON COMPOUND POISSON POPULATION MODELS ON COMPOUND POISSON POPULATION MODELS Martin Möhle, University of Tübingen (joint work with Thierry Huillet, Université de Cergy-Pontoise) Workshop on Probability, Population Genetics and Evolution Centre

More information

PREPRINT 2007:25. Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA

PREPRINT 2007:25. Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA PREPRINT 2007:25 Multitype Galton-Watson processes escaping extinction SERIK SAGITOV MARIA CONCEIÇÃO SERRA Department of Mathematical Sciences Division of Mathematical Statistics CHALMERS UNIVERSITY OF

More information

The tail does not determine the size of the giant

The tail does not determine the size of the giant The tail does not determine the size of the giant arxiv:1710.01208v2 [math.pr] 20 Jun 2018 Maria Deijfen Sebastian Rosengren Pieter Trapman June 2018 Abstract The size of the giant component in the configuration

More information

14 Branching processes

14 Branching processes 4 BRANCHING PROCESSES 6 4 Branching processes In this chapter we will consider a rom model for population growth in the absence of spatial or any other resource constraints. So, consider a population of

More information

Resistance Growth of Branching Random Networks

Resistance Growth of Branching Random Networks Peking University Oct.25, 2018, Chengdu Joint work with Yueyun Hu (U. Paris 13) and Shen Lin (U. Paris 6), supported by NSFC Grant No. 11528101 (2016-2017) for Research Cooperation with Oversea Investigators

More information

Theory of Stochastic Processes 3. Generating functions and their applications

Theory of Stochastic Processes 3. Generating functions and their applications Theory of Stochastic Processes 3. Generating functions and their applications Tomonari Sei sei@mist.i.u-tokyo.ac.jp Department of Mathematical Informatics, University of Tokyo April 20, 2017 http://www.stat.t.u-tokyo.ac.jp/~sei/lec.html

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2

MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on

More information

BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES

BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES BRANCHING PROCESSES 1. GALTON-WATSON PROCESSES Galton-Watson processes were introduced by Francis Galton in 1889 as a simple mathematical model for the propagation of family names. They were reinvented

More information

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

Homework 6: Solutions Sid Banerjee Problem 1: (The Flajolet-Martin Counter) ORIE 4520: Stochastics at Scale Fall 2015 Problem 1: (The Flajolet-Martin Counter) In class (and in the prelim!), we looked at an idealized algorithm for finding the number of distinct elements in a stream, where we sampled uniform random variables

More information

arxiv:math.pr/ v1 17 May 2004

arxiv:math.pr/ v1 17 May 2004 Probabilistic Analysis for Randomized Game Tree Evaluation Tämur Ali Khan and Ralph Neininger arxiv:math.pr/0405322 v1 17 May 2004 ABSTRACT: We give a probabilistic analysis for the randomized game tree

More information

Chapter 5. Weak convergence

Chapter 5. Weak convergence Chapter 5 Weak convergence We will see later that if the X i are i.i.d. with mean zero and variance one, then S n / p n converges in the sense P(S n / p n 2 [a, b])! P(Z 2 [a, b]), where Z is a standard

More information

arxiv: v1 [math.pr] 13 Nov 2018

arxiv: v1 [math.pr] 13 Nov 2018 PHASE TRANSITION FOR THE FROG MODEL ON BIREGULAR TREES ELCIO LEBENSZTAYN AND JAIME UTRIA arxiv:1811.05495v1 [math.pr] 13 Nov 2018 Abstract. We study the frog model with death on the biregular tree T d1,d

More information

Hard-Core Model on Random Graphs

Hard-Core Model on Random Graphs Hard-Core Model on Random Graphs Antar Bandyopadhyay Theoretical Statistics and Mathematics Unit Seminar Theoretical Statistics and Mathematics Unit Indian Statistical Institute, New Delhi Centre New Delhi,

More information

Random Process Lecture 1. Fundamentals of Probability

Random Process Lecture 1. Fundamentals of Probability Random Process Lecture 1. Fundamentals of Probability Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/43 Outline 2/43 1 Syllabus

More information

88 CONTINUOUS MARKOV CHAINS

88 CONTINUOUS MARKOV CHAINS 88 CONTINUOUS MARKOV CHAINS 3.4. birth-death. Continuous birth-death Markov chains are very similar to countable Markov chains. One new concept is explosion which means that an infinite number of state

More information

Bootstrap Percolation on Periodic Trees

Bootstrap Percolation on Periodic Trees Bootstrap Percolation on Periodic Trees Milan Bradonjić Iraj Saniee Abstract We study bootstrap percolation with the threshold parameter θ 2 and the initial probability p on infinite periodic trees that

More information

THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH

THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH THE SECOND LARGEST COMPONENT IN THE SUPERCRITICAL 2D HAMMING GRAPH REMCO VAN DER HOFSTAD, MALWINA J. LUCZAK, AND JOEL SPENCER Abstract. The 2-dimensional Hamming graph H(2, n consists of the n 2 vertices

More information

A simple branching process approach to the phase transition in G n,p

A simple branching process approach to the phase transition in G n,p A simple branching process approach to the phase transition in G n,p Béla Bollobás Department of Pure Mathematics and Mathematical Statistics Wilberforce Road, Cambridge CB3 0WB, UK b.bollobas@dpmms.cam.ac.uk

More information

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

On the behavior of the population density for branching random. branching random walks in random environment. July 15th, 2011 On the behavior of the population density for branching random walks in random environment Makoto Nakashima Kyoto University July 15th, 2011 Branching Processes offspring distribution P(N) = {{q(k)} k=0

More information

Metapopulations with infinitely many patches

Metapopulations with infinitely many patches Metapopulations with infinitely many patches Phil. Pollett The University of Queensland UQ ACEMS Research Group Meeting 10th September 2018 Phil. Pollett (The University of Queensland) Infinite-patch metapopulations

More information

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

More information

Conceptual Proofs of L log L Criteria. By Russell Lyons, Robin Pemantle, and Yuval Peres

Conceptual Proofs of L log L Criteria. By Russell Lyons, Robin Pemantle, and Yuval Peres To appear in Ann. Probab. Version of 9 September 994 Conceptual Proofs of L log L Criteria for Mean Behavior of Branching Processes By Russell Lyons, Robin Pemantle, and Yuval Peres Abstract. The Kesten-Stigum

More information

SOLUTIONS OF SEMILINEAR WAVE EQUATION VIA STOCHASTIC CASCADES

SOLUTIONS OF SEMILINEAR WAVE EQUATION VIA STOCHASTIC CASCADES Communications on Stochastic Analysis Vol. 4, No. 3 010) 45-431 Serials Publications www.serialspublications.com SOLUTIONS OF SEMILINEAR WAVE EQUATION VIA STOCHASTIC CASCADES YURI BAKHTIN* AND CARL MUELLER

More information

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

LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE. S. Kurbanov Serdica Math. J. 34 (2008), 483 488 LIMIT THEOREMS FOR NON-CRITICAL BRANCHING PROCESSES WITH CONTINUOUS STATE SPACE S. Kurbanov Communicated by N. Yanev Abstract. In the paper a modification of the branching

More information

First order logic on Galton-Watson trees

First order logic on Galton-Watson trees First order logic on Galton-Watson trees Moumanti Podder Georgia Institute of Technology Joint work with Joel Spencer January 9, 2018 Mathematics Seminar, Indian Institute of Science, Bangalore 1 / 20

More information

1 Sequences of events and their limits

1 Sequences of events and their limits O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For

More information

On the age of a randomly picked individual in a linear birth and death process

On the age of a randomly picked individual in a linear birth and death process On the age of a randomly picked individual in a linear birth and death process Fabian Kück, 2 and Dominic Schuhmacher,3 University of Göttingen September 7, 27 Abstract We consider the distribution of

More information

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

FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES FRINGE TREES, CRUMP MODE JAGERS BRANCHING PROCESSES AND m-ary SEARCH TREES CECILIA HOLMGREN AND SVANTE JANSON Abstract. This survey studies asymptotics of random fringe trees and extended fringe trees

More information

Critical behavior in inhomogeneous random graphs

Critical behavior in inhomogeneous random graphs Critical behavior in inhomogeneous random graphs Remco van der Hofstad June 1, 21 Abstract We study the critical behavior of inhomogeneous random graphs where edges are present independently but with unequal

More information

A Branching-selection process related to censored Galton-Walton. processes

A Branching-selection process related to censored Galton-Walton. processes A Branching-selection process related to censored Galton-Walton processes Olivier Couronné, Lucas Gerin Université Paris Ouest Nanterre La Défense. Equipe Modal X. 200 avenue de la République. 92000 Nanterre

More information

Crump Mode Jagers processes with neutral Poissonian mutations

Crump Mode Jagers processes with neutral Poissonian mutations Crump Mode Jagers processes with neutral Poissonian mutations Nicolas Champagnat 1 Amaury Lambert 2 1 INRIA Nancy, équipe TOSCA 2 UPMC Univ Paris 06, Laboratoire de Probabilités et Modèles Aléatoires Paris,

More information

Necessary and sufficient conditions for the convergence of the consistent maximal displacement of the branching random walk

Necessary and sufficient conditions for the convergence of the consistent maximal displacement of the branching random walk Necessary and sufficient conditions for the convergence of the consistent maximal displacement of the branching random walk Bastien Mallein January 4, 08 Abstract Consider a supercritical branching random

More information

A. Bovier () Branching Brownian motion: extremal process and ergodic theorems

A. Bovier () Branching Brownian motion: extremal process and ergodic theorems Branching Brownian motion: extremal process and ergodic theorems Anton Bovier with Louis-Pierre Arguin and Nicola Kistler RCS&SM, Venezia, 06.05.2013 Plan 1 BBM 2 Maximum of BBM 3 The Lalley-Sellke conjecture

More information

Mandelbrot s cascade in a Random Environment

Mandelbrot s cascade in a Random Environment Mandelbrot s cascade in a Random Environment A joint work with Chunmao Huang (Ecole Polytechnique) and Xingang Liang (Beijing Business and Technology Univ) Université de Bretagne-Sud (Univ South Brittany)

More information

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS

EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS (February 25, 2004) EXTINCTION TIMES FOR A GENERAL BIRTH, DEATH AND CATASTROPHE PROCESS BEN CAIRNS, University of Queensland PHIL POLLETT, University of Queensland Abstract The birth, death and catastrophe

More information

Introduction to self-similar growth-fragmentations

Introduction to self-similar growth-fragmentations Introduction to self-similar growth-fragmentations Quan Shi CIMAT, 11-15 December, 2017 Quan Shi Growth-Fragmentations CIMAT, 11-15 December, 2017 1 / 34 Literature Jean Bertoin, Compensated fragmentation

More information

PARKING ON A RANDOM TREE

PARKING ON A RANDOM TREE PARKING ON A RANDOM TREE CHRISTINA GOLDSCHMIDT AND MICHA L PRZYKUCKI Abstract. Consider a uniform random rooted tree on vertices labelled by [n] = {1, 2,..., n}, with edges directed towards the root. We

More information

Review of Probability. CS1538: Introduction to Simulations

Review of Probability. CS1538: Introduction to Simulations Review of Probability CS1538: Introduction to Simulations Probability and Statistics in Simulation Why do we need probability and statistics in simulation? Needed to validate the simulation model Needed

More information

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

Survival Probabilities for N-ary Subtrees on a Galton-Watson Family Tree Survival Probabilities for N-ary Subtrees on a Galton-Watson Family Tree arxiv:0706.1904v2 [math.pr] 4 Mar 2008 Ljuben R. Mutafchiev American University in Bulgaria 2700 Blagoevgrad, Bulgaria and Institute

More information

Ferromagnetic Ising models

Ferromagnetic Ising models Stat 36 Stochastic Processes on Graphs Ferromagnetic Ising models Amir Dembo Lecture 3-4 - 0/5/2007 Introduction By ferromagnetic Ising models we mean the study of the large-n behavior of the measures

More information

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

Example: physical systems. If the state space. Example: speech recognition. Context can be. Example: epidemics. Suppose each infected 4. Markov Chains A discrete time process {X n,n = 0,1,2,...} with discrete state space X n {0,1,2,...} is a Markov chain if it has the Markov property: P[X n+1 =j X n =i,x n 1 =i n 1,...,X 0 =i 0 ] = P[X

More information

RARE EVENT SIMULATION FOR STOCHASTIC FIXED POINT EQUATIONS RELATED TO THE SMOOTHING TRANSFORMATION. Jie Xu

RARE EVENT SIMULATION FOR STOCHASTIC FIXED POINT EQUATIONS RELATED TO THE SMOOTHING TRANSFORMATION. Jie Xu Proceedings of the 2013 Winter Simulation Conference R. Pasupathy, S.-H. Kim, A. Tolk, R. Hill, and M. E. Kuhl, eds. RARE EVENT SIMULATION FOR STOCHASTIC FIXED POINT EQUATIONS RELATED TO THE SMOOTHING

More information

Age-dependent branching processes with incubation

Age-dependent branching processes with incubation Age-dependent branching processes with incubation I. RAHIMOV Department of Mathematical Sciences, KFUPM, Box. 1339, Dhahran, 3161, Saudi Arabia e-mail: rahimov @kfupm.edu.sa We study a modification of

More information

Almost giant clusters for percolation on large trees

Almost giant clusters for percolation on large trees for percolation on large trees Institut für Mathematik Universität Zürich Erdős-Rényi random graph model in supercritical regime G n = complete graph with n vertices Bond percolation with parameter p(n)

More information

arxiv: v2 [math.pr] 25 Feb 2017

arxiv: v2 [math.pr] 25 Feb 2017 ypical behavior of the harmonic measure in critical Galton Watson trees with infinite variance offspring distribution Shen LIN LPMA, Université Pierre et Marie Curie, Paris, France E-mail: shen.lin.math@gmail.com

More information

Chapter 3. Erdős Rényi random graphs

Chapter 3. Erdős Rényi random graphs Chapter Erdős Rényi random graphs 2 .1 Definitions Fix n, considerthe set V = {1,2,...,n} =: [n], andput N := ( n 2 be the numberofedgesonthe full graph K n, the edges are {e 1,e 2,...,e N }. Fix also

More information

Scaling limits for random trees and graphs

Scaling limits for random trees and graphs YEP VII Probability, random trees and algorithms 8th-12th March 2010 Scaling limits for random trees and graphs Christina Goldschmidt INTRODUCTION A taste of what s to come We start with perhaps the simplest

More information

Advanced School and Conference on Statistics and Applied Probability in Life Sciences. 24 September - 12 October, 2007

Advanced School and Conference on Statistics and Applied Probability in Life Sciences. 24 September - 12 October, 2007 1863-5 Advanced School and Conference on Statistics and Applied Probability in Life Sciences 24 September - 12 October, 2007 Branching Processes and Population Dynamics Peter Jagers Chalmers University

More information

process on the hierarchical group

process on the hierarchical group Intertwining of Markov processes and the contact process on the hierarchical group April 27, 2010 Outline Intertwining of Markov processes Outline Intertwining of Markov processes First passage times of

More information

Maximum Agreement Subtrees

Maximum Agreement Subtrees Maximum Agreement Subtrees Seth Sullivant North Carolina State University March 24, 2018 Seth Sullivant (NCSU) Maximum Agreement Subtrees March 24, 2018 1 / 23 Phylogenetics Problem Given a collection

More information

an author's

an author's an author's https://oatao.univ-toulouse.fr/1878 Simatos, Florian and Schertzer, Emmanuel Height and contour processes of Crump-Mode-Jagers forests(i): general distribution and scaling limits in the case

More information

ESTIMATION OF THE OFFSPRING AND IMMIGRATION MEAN VECTORS FOR BISEXUAL BRANCHING PROCESSES WITH IMMIGRATION OF FEMALES AND MALES

ESTIMATION OF THE OFFSPRING AND IMMIGRATION MEAN VECTORS FOR BISEXUAL BRANCHING PROCESSES WITH IMMIGRATION OF FEMALES AND MALES Pliska Stud. Math. Bulgar. 20 (2011), 63 80 STUDIA MATHEMATICA BULGARICA ESTIMATION OF THE OFFSPRING AND IMMIGRATION MEAN VECTORS FOR BISEXUAL BRANCHING PROCESSES WITH IMMIGRATION OF FEMALES AND MALES

More information

The Contraction Method on C([0, 1]) and Donsker s Theorem

The Contraction Method on C([0, 1]) and Donsker s Theorem The Contraction Method on C([0, 1]) and Donsker s Theorem Henning Sulzbach J. W. Goethe-Universität Frankfurt a. M. YEP VII Probability, random trees and algorithms Eindhoven, March 12, 2010 joint work

More information

Asymptotics of random sums of heavy-tailed negatively dependent random variables with applications

Asymptotics of random sums of heavy-tailed negatively dependent random variables with applications Asymptotics of random sums of heavy-tailed negatively dependent random variables with applications Remigijus Leipus (with Yang Yang, Yuebao Wang, Jonas Šiaulys) CIRM, Luminy, April 26-30, 2010 1. Preliminaries

More information

MAXIMAL CLADES IN RANDOM BINARY SEARCH TREES

MAXIMAL CLADES IN RANDOM BINARY SEARCH TREES MAXIMAL CLADES IN RANDOM BINARY SEARCH TREES SVANTE JANSON Abstract. We study maximal clades in random phylogenetic trees with the Yule Harding model or, equivalently, in binary search trees. We use probabilistic

More information

arxiv: v2 [math.pr] 10 Jul 2013

arxiv: v2 [math.pr] 10 Jul 2013 On the critical value function in the divide and color model András Bálint Vincent Beffara Vincent Tassion May 17, 2018 arxiv:1109.3403v2 [math.pr] 10 Jul 2013 Abstract The divide and color model on a

More information

Poisson Processes. Particles arriving over time at a particle detector. Several ways to describe most common model.

Poisson Processes. Particles arriving over time at a particle detector. Several ways to describe most common model. Poisson Processes Particles arriving over time at a particle detector. Several ways to describe most common model. Approach 1: a) numbers of particles arriving in an interval has Poisson distribution,

More information

Jumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese

Jumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October

More information

Explosion in branching processes and applications to epidemics in random graph models

Explosion in branching processes and applications to epidemics in random graph models Explosion in branching processes and applications to epidemics in random graph models Júlia Komjáthy joint with Enrico Baroni and Remco van der Hofstad Eindhoven University of Technology Advances on Epidemics

More information

Decomposition of supercritical branching processes with countably many types

Decomposition of supercritical branching processes with countably many types Pomorie 26 June 2012 Serik Sagitov and Altynay Shaimerdenova 20 slides Chalmers University and University of Gothenburg Al-Farabi Kazakh National University Decomposition of supercritical branching processes

More information

Erdős-Renyi random graphs basics

Erdős-Renyi random graphs basics Erdős-Renyi random graphs basics Nathanaël Berestycki U.B.C. - class on percolation We take n vertices and a number p = p(n) with < p < 1. Let G(n, p(n)) be the graph such that there is an edge between

More information

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014 Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note

More information

Homework 3 posted, due Tuesday, November 29.

Homework 3 posted, due Tuesday, November 29. Classification of Birth-Death Chains Tuesday, November 08, 2011 2:02 PM Homework 3 posted, due Tuesday, November 29. Continuing with our classification of birth-death chains on nonnegative integers. Last

More information

Applied Stochastic Processes

Applied Stochastic Processes Applied Stochastic Processes Jochen Geiger last update: July 18, 2007) Contents 1 Discrete Markov chains........................................ 1 1.1 Basic properties and examples................................

More information

Three Disguises of 1 x = e λx

Three Disguises of 1 x = e λx Three Disguises of 1 x = e λx Chathuri Karunarathna Mudiyanselage Rabi K.C. Winfried Just Department of Mathematics, Ohio University Mathematical Biology and Dynamical Systems Seminar Ohio University November

More information

Limiting distribution for subcritical controlled branching processes with random control function

Limiting distribution for subcritical controlled branching processes with random control function Available online at www.sciencedirect.com Statistics & Probability Letters 67 (2004 277 284 Limiting distribution for subcritical controlled branching processes with random control function M. Gonzalez,

More information

Lectures 16-17: Poisson Approximation. Using Lemma (2.4.3) with θ = 1 and then Lemma (2.4.4), which is valid when max m p n,m 1/2, we have

Lectures 16-17: Poisson Approximation. Using Lemma (2.4.3) with θ = 1 and then Lemma (2.4.4), which is valid when max m p n,m 1/2, we have Lectures 16-17: Poisson Approximation 1. The Law of Rare Events Theorem 2.6.1: For each n 1, let X n,m, 1 m n be a collection of independent random variables with PX n,m = 1 = p n,m and PX n,m = = 1 p

More information

LIMIT THEOREMS FOR A RANDOM GRAPH EPIDEMIC MODEL. By Håkan Andersson Stockholm University

LIMIT THEOREMS FOR A RANDOM GRAPH EPIDEMIC MODEL. By Håkan Andersson Stockholm University The Annals of Applied Probability 1998, Vol. 8, No. 4, 1331 1349 LIMIT THEOREMS FOR A RANDOM GRAPH EPIDEMIC MODEL By Håkan Andersson Stockholm University We consider a simple stochastic discrete-time epidemic

More information

Notes 18 : Optional Sampling Theorem

Notes 18 : Optional Sampling Theorem Notes 18 : Optional Sampling Theorem Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Chapter 14], [Dur10, Section 5.7]. Recall: DEF 18.1 (Uniform Integrability) A collection

More information

Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions

Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Rare Events in Random Walks and Queueing Networks in the Presence of Heavy-Tailed Distributions Sergey Foss Heriot-Watt University, Edinburgh and Institute of Mathematics, Novosibirsk The University of

More information

4 Branching Processes

4 Branching Processes 4 Branching Processes Organise by generations: Discrete time. If P(no offspring) 0 there is a probability that the process will die out. Let X = number of offspring of an individual p(x) = P(X = x) = offspring

More information

Learning Session on Genealogies of Interacting Particle Systems

Learning Session on Genealogies of Interacting Particle Systems Learning Session on Genealogies of Interacting Particle Systems A.Depperschmidt, A.Greven University Erlangen-Nuremberg Singapore, 31 July - 4 August 2017 Tree-valued Markov processes Contents 1 Introduction

More information

A NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES

A NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES Bull. Korean Math. Soc. 52 (205), No. 3, pp. 825 836 http://dx.doi.org/0.434/bkms.205.52.3.825 A NOTE ON THE COMPLETE MOMENT CONVERGENCE FOR ARRAYS OF B-VALUED RANDOM VARIABLES Yongfeng Wu and Mingzhu

More information

P i [B k ] = lim. n=1 p(n) ii <. n=1. V i :=

P i [B k ] = lim. n=1 p(n) ii <. n=1. V i := 2.7. Recurrence and transience Consider a Markov chain {X n : n N 0 } on state space E with transition matrix P. Definition 2.7.1. A state i E is called recurrent if P i [X n = i for infinitely many n]

More information

Poisson INAR processes with serial and seasonal correlation

Poisson INAR processes with serial and seasonal correlation Poisson INAR processes with serial and seasonal correlation Márton Ispány University of Debrecen, Faculty of Informatics Joint result with Marcelo Bourguignon, Klaus L. P. Vasconcellos, and Valdério A.

More information