The Symbiotic Contact Process

We consider a contact process on $Z^d$ with two species that interact in a symbiotic manner. Each site can either be vacant or occupied by individuals of species $A$ and/or $B$. Multiple occupancy by the same species at a single site is prohibited. The name symbiotic comes from the fact that if only one species is present at a site then that particle dies with rate 1 but if both species are present then the death rate is reduced to $\mu \le 1$ for each particle at that site. We show the critical birth rate $\lambda_c(\mu)$ for weak survival is of order $\sqrt{\mu}$ as $\mu \to 0$. Mean-field calculations predict that when $\mu<1/2$ there is a discontinuous transition as $\lambda$ is varied. In contrast, we show that, in any dimension, the phase transition is continuous. To be fair to physicists the paper that introduced the model, the authors say that the symbiotic contact process is in the directed percolation universality class and hence has a continuous transition. However, a 2018 paper asserts that the transition is discontinuous above the upper critical dimension, which is 4 for oriented percolation.


Introduction
In the ordinary contact process the state at time t is a function ξ t : Z d → {0, 1}. 1's are particles and 0's are empty sites. Particles die at rate 1, and are born at vacant sites at rate λf 1 where f 1 is the number of nearest neighbors in state 1. A number of contact processes with two types of particles have been investigated. Neuhauser [26] considered the competing contact process ξ t : Z d → {0, 1, 2}. 0's again are vacant sites but now 1's and 2's are two types of particles. Each type of particle dies at rate 1, while particles of type i are born at vacant sites at rate λ i f i where f i is the fraction of nearest neighbors in state i, i = 1, 2 . She showed that there was no coexistence if λ 1 = λ 2 . When λ 1 = λ 2 there is no coexistence in d ≤ 2 but there is when d ≥ 3, behavior reminiscent of the voter model. Durrett and Swindle [17] studied a contact process in which 0's are vacant sites, 1's are bushes and 2's are trees. 1's and 2's die at rate 1. Particles of type i give birth at ξ t : Z d → {0, A, B, AB}. Here A's and B's are different species of particles. As in the contact process there can be at most one individual of a given type at a site, but in this process there can be one A and one B at a site. If only one type is present then the system reduces to a contact process in which particles die at rate 1, and vacant sites become occupied at rate λf k where f k is the fraction of neighbors in state i. Presence of the other type does not affect the birth rates, but the death rates of particles at doubly occupied sites is reduced to µ ≤ 1 due to the symbiotic interaction between the two species.

Mean-field calculations
Often the first step in understanding the behavior of an interacting particle is to look at the predictions of mean-field theory in which we pretend that adjacent sites are independent. Let p 0 , p A , p B and p AB be the probabilities a site is in state (0, 0), (1, 0), (0, 1), and (1, 1). By considering the possible transitions we see that dp A dt = λp 0 (p A + p AB ) + µp AB − p A − λp A (p B + p AB ) See (1) in [27]. We are only interested in solutions with p A = p B = p. (1.2) implies that in equilibrium we must have 2λp 2 + 2λpp AB − 2µp AB = 0.
Solving gives p AB = λp 2 µ − λp . Combining equations (1.3) and (1.4) we arrive at a quadratic equation for p with coefficients that are quadratic polynomials in µ and λ. Solving, see Section 2, leads to the conclusions • For µ ≥ 1/2, p grows continuously from zero at λ = 1.

Bounds on the critical value
Before defining critical value, we introduce a graphical representation for the symbiotic contact process (SCP). For each ordered pair of neighboring sites x, y ∈ Z d we let I x,y,A be a Poisson process with rate λ/2d. When the Poisson clock associated to (x, y) rings, we draw an arrow from x to y to indicate a possible infection events from x to y, i.e., if there is an A or AB at x at this time and there is no A or AB at y then the state at y will change from 0 to A or from B to AB. Simirly we introduce the Poisson processes I x,y,B to indicate the possible infection events of species B. In what follows, we will frequently use the term 'arrow' to refer to possible infection events.
Throughout the paper we will suppose µ ≤ 1. To represent the death events, we use Poisson processes D x,A,1 with rate µ to denote death events that kills species A at site x no matter whether B is present at x at that time or not. We also introduce Poisson processes D x,A,2 with rate 1 − µ to denote the death events that kill species A at site x only if B is not present at x. Similarly we also introduce two Poisson processes D x,B,1 and D x,B,2 to produce death events for species B. All the Poisson processes in the construction are independent.
Let A t be the number of sites that have an A, and let B t be the number of sites that have a B. Let Ω ∞ = {A t > 0 and B t > 0 for all t} (1.5) be the event that the process survives. Using the graphical representation we can construct a coupling between SCP with µ 1 = µ 2 and λ 1 ≤ λ 2 by introducing new Poisson processes with rate λ 2 − λ 1 that produce additional infections in the second process but not in the first. It is easy to see that if Ω ∞ happens in the first process then it also happens in the second. Let P AB,0 (Ω ∞ ) be the probability of survival when we start with one AB at the origin and all other sites vacant. It follows from the coupling that P AB,0 (Ω ∞ ) is an nondecreasing function of λ for fixed µ. Hence we can define the critical value λ c (µ) = inf{λ : P AB,0 (Ω ∞ ) > 0}. (1.6) If we set µ = 1 then the A's and B's are independent contact process. Using the graphical construction again we see that if µ ≤ 1 then λ c (µ) ≤ λ c (1) where λ c (1) is the critical value for survival of ordinary contact process on Z d . To do this we build the process with µ using death Poisson processesD x,A,1 andD x,B,1 that are a superposition of D x,A,1 and D x,A,2 and D x,B,1 and D x,B,2 respectively.
The next result shows that symbiosis can have a great effect on the survival of the system. The upper bound uses a block construction which sacrifices accuracy to keep the renormalized sites independent, so it is very crude. As in the case of the ordinary contact process one can project Z d into Z by mapping x → x 1 + · · · + x d in order to extend the result to d > 1.
The values of C 1 (µ) and C 2 (µ) are summarized in the following table.
To explain the division into cases, recall λ c (1)

The phase transition is continuous
We use a block construction for the basic contact process that is similar to the one originally developed by Bezuidenhout and Grimmett [6]. We follow the approach in Section 1.2 of Liggett [24]. For positive number L, let I = [−(a + h)L, (a + h)L] and W = I d . The constant a is given in (4.4 We will have 2d side slabs. They are The union of the side slabs S L,T = ∪ d i=1 (S i,+ L,T ∪ S i,− L,T ) is an "annulus" with (outer) sides and inner sides (1) and that the SCP starting from a single AB at the origin survives with positive probability and λ < λ c (1). For any > 0, there are choices of a (only depending on λ), n, L, T , s.t.
By symmetry the last result holds for S i,− L,T . This is the analog of Theorem 2.12 in Liggett [24]. Once this is done one can repeat the comparison with oriented percolation described on pages 51-55 in [24] to show that the SCP dies out at the critical value. The restriction to λ < λ c (1) in Theorem 1.2 is needed because our proof uses the fact that the system with only one type of particle is subcritical. It is natural to The bounds on the critical value given in Theorem 1.1 imply that λ c (µ) < λ c (1) for small µ. Strict monotonicity results for critical values have been proved for percolation, the Ising model, and other related systems. For early results see Chapter 10 of Kesten's book on percolation [21]. Given a pair of lattices, L 1 and L 2 , Menshikov [25] gave conditions that guaranteed that the site percolation critical values p c (L 1 ) > p c (L 2 ). His results were later generalized in [1] by Aizenman and Grimmett, who showed that the critical value for an infinite entangled set of open bonds in Z 3 is smaller than that the critical value for an infinite connected component of open bonds. They also showed for ferromagnetic spin systems that the critical temperature was a strictly increasing function of the interaction strengths. For more results in this direction see Bezuidenhout, Grimmett, and Kesten [7], or Balister, Bollobás and Riordan [4]. Results for the Ising and Potts models are proved by reducing to dependent percolation using the Fortuin-Kasteleyn representation. In the analysis of percolation one uses that there is only one fluid moving through the graph, so we do not think these methods can be used to prove Conjecture 1.3, which involves two types of fluids spreading through a graphical representation.
In the case of the ordinary contact process, η t , a second corollary of Theorem 1.2 is the complete convergence theorem. That is if τ = inf{t : η t = ∅} then η t ⇒ P (τ < ∞)δ 0 + P (τ = ∞)η 1 ∞ Here ⇒ is convergence in distribution, δ 0 the point mass on the all 0's configuration and η 1 ∞ is the limit starting from all sites occupied. The SCP is attractive so the limit ξ AB ∞ starting from all AB exists, but SCP process is not additive in the sense of Harris [20], so there is no dual process, which is a key ingredient in the contact process proof. Therefore one can not duduce complete convergence for SCP process from Theorem 1.2. (It is not clear to the authors whether complete convergence holds or not.) The absence of an additive dual creates another open problem. We say ξ AB ∞ is nontrivial if it puts positive mass on configurations with infinitely many A's and infinitely many B's. Using the graphical representation for the SCP introduced in Section 1.2 one can show if ξ AB ∞ is nontrivial for some λ 1 , then ξ AB ∞ must also be nontrivial for any λ ≥ λ 1 . Hence for fixed µ ≤ 1 we can define another critical value. λ e (µ) = inf{λ : ξ AB ∞ is nontrivial}.
Using the graphical representation one can show that where Ω ∞ has been defined in (1.5). It is the probability that SCP starting from a sgingle site survives. This implies that λ e ≤ λ c . Toom's model shows that these two critical values are not equal in general. In this model the state of the system is ξ t : Z 2 → {0, 1}.
As in the contact process occupied sites (1's) become vacant (0) at rate 1. However now a vacant site at x becomes occupied at rate λ only if both x + (1, 0) and x + (0, 1) are occupied. For Toom's model finite configuration cannot escape from a box that contains it, since if initially ξ 0 ∈ R for some rectangle R, then all x with x / ∈ R can't get infected since either x+ (1, 0) or x+ (0, 1) is not in R. Since we have a death rate 1 for all occupied sites, there must be a finite time when all sites of R becomes empty. The process then dies out. It follows that λ c = ∞. Toom [31] proved that λ e < ∞. See Bramson and Gray [8] for another approach. For some rigorous results about this model see [12].
It would be interesting if the SCP was another example in which the two critical values are different, but we have no reason to believe they should be, so we

Symbiotic contact process with diffusion
The question we address here is "What happens if, in additions to the birth and death events, we also let particles move according to the simple exclusion process?" This question was considered by de Olivera and Dickman [28]. To be precise, we view the symbiotic contact process as taking place on Z d × {0, 1} with A's living on level 0 and B's living on level 1. Particles jump to each neighbor on the same level at rate −2 , subject to the exclusion rule: if the chosen neighbor is already occupied then nothing happens. We refer to this process as the symbiotic contact process with diffusion (SCPD) and denote it by ξ t .
In [28] simulations showed that for moderate diffusion rates, the process exhibits discontinuous phase transition but the transition becomes continuous again once gets small enough. They conjecture the critical value for λ for small is 1 regardless of the value of µ. Theorem 1.5 supports their conjecture.
Consider the SCPD starting from all sites occupied by AB. By attractiveness ξ ,AB t has a weak limit as t → ∞ that we denote by ξ ,AB ∞ . Here, we are interested in the limit of ξ ,AB ∞ as → 0. To do this using the methods of Durrett and Neuhauser [15] it is convenient to implement the simple exclusion dynamics using the stirring process: for each pair of neighbors x and y on a given level we exchange the values at x and y on that level at rate −2 . Following the approach in [15] the first step is to show convergence of a "dual process" to a branching Brownian motion and then derive a partial differential equation for the evolution of the local densities of A, B and AB, which we denote by p If we use the initial condition q A (0, ·) = q B (0, ·) = 1 then by symmetry we can replace q B by q A in equation (1.9) to get The reaction term on the right-hand side is = 0 when q A = 0 or q A = (λ − 1)/(λ − 1 + µ). If λ < 1 the reaction term is < 0 on (0, 1] so the limit is ≡ 0. When λ > 1, we have f (0) = λ − 1 > 0, so the root at 0 is unstable. Results of Aronson and Weinberger [2,3] imply that (1.11) has a traveling wave solution and that starting from any initial on a linearly growing set.
The Symbiotic Contact Process The fast stirring makes the states on the A and B lattice independent so the equilibrium density of AB's is Subtracting this from the limit of the q A we find that the limiting density of A's and B"s are given by Combining the PDE result with a block construction one can establish the existence of a nontrivial stationary distribution when λ < 1 using the methods in [15]. However, if we use Theorem 1.4 in [9] instead we get the stronger result: is nontrivial, and in any stationary distribution that assigns mass 1 to configurations with infinitely many A's and B's the densities of A's, B's, and AB's are close to p A , p B and p AB .
The proof of Theorem 1.5 is described in Section 7. All of the steps are in [15] or [9], but for the convenience of the reader, we will give an outline of the argument and indicate where detailed proofs can be found. It may surprise the reader to hear that the proof of the second result is much more difficult than the first. In part (i) if we can prove that the densities are close to the proposed values then we can conclude there is a non-trivial stationary distribution. However, in part (ii) we have to show that the density is 0, not just close to 0.

Outline of the paper
The remainder of the paper is devoted to proofs. The mean-field calculations are carried out in Section 2. The bounds on the critical values are proved in Section 3. The proof of Theorem 1.2 fills Sections 4 to 6. We will now state the two lemmas that are the key to its proof. However, first we need more notations.
Given a finite space-time rectangular solid R, the number of AB's in R, AB(R), is the size of the largest set C of space time points ( Since the size of such a collection is bounded above by the cardinality of a set that has a point at each x every 1 unit of time, a maximal set exists. Similarly we can define A(R), B(R).
For some M, N > 0, whose specific values are to be determined, let We omit the dependence of various events on parameters other than L and T to make notation simpler. Recall we start the SCP from [−n, n] d occupied by AB. Also, there is a parameter a involved in the definition of the block construction in Section 1.3. In the next two lemmas κ(λ) is a constant introduced in equation (4.2) and (4.3). Let Ω 0 be the event that the SCP dies out.
These Lemmas are similar to steps in Liggett's proof. For example, Lemma 1.6 is analogous to his Proposition 2.8. However, here we need a large number of sites occupied by AB's in S i,+ Lj ,Tj , but the argument in [24] only gives us a large number of sites occupied by A's or B's. Intuitively since the SCP with only one type contact is subcritical an isolated A will soon die. So if the SCP is to survive with high probability there must be many AB's . To translate this idea into a proof, we show in Section 5 that an A on the inner side ρ i,+ L,T is unlikely to have a descendant on the outer side σ i,+ L,T unless it encounters a B along the way (and hence produces an AB).
Lemma 1.6 is proved in Section 4 and Lemma 1.7 in Section 5. These two results are combined in Section 6 to prove Theorem 1.2. All of this material is independent of the calculations in Sections 2 and 3.
so the roots can be written as which agrees with (5) in [28].
We first compute for the process with µ = 0. Without loss of generality suppose m = 0 and n = 0 and that the AB is at 0. The state of site 1 will go from 0 → A or B at rate λ A or B → 0 at rate 1 A or B → AB at rate λ/2 Let N be the number of transitions 0 → A or B before we arrive at AB. Since this is the first time the third transition occurs before the second one, it is clear that N has a geometric distribution with success probability (λ/2)/(1 + λ/2), that is, The time t 1 for a transition 0 → A or B is exponential with rate r 1 = λ. The time t 2 for A or B → 0 or AB is exponential with rate r 2 = 1 + (λ/2). The means are Et 1 = 1/λ and Et 2 = (1 + λ/2) −1 = O(1) respectively. As λ → 0, the second will be much smaller than the first. The total waiting time is (t 1 1 + · · · + t 1 N ) + (t 2 1 + · · · + t 2 N ). The following well-known result shows each sum has an exponential distribution. We include its simple proof for completeness.

Lemma 3.2.
If N is geometric with success probability p, i.e., P (N = k) = p(1 − p) k−1 , and X 1 , X 2 , . . . are an independent i.i.d. sequence with an exponential distribution with rate r then S N = X 1 + · · · + X N is exponential with rate pr.
Proof. E exp(θX i ) = r/(r + θ) so conditioning on the value of N which is the Laplace transform of an exponential with rate rp proving the desired result.

Let c be a constant to be chosen later and let
If we let S 1 −1 the time to produce an AB at −1 then by Lemma 3.2 we have If we let S 1 1 the time to produce an AB at 1 and S 1 2 be the additional time to produce an AB at 2 then P(S 1 To return to the situation where µ > 0 we note that the probability there is no µ-death on {−1, 0, 1, 2} during [0, T ] is e −4µT . If we take µ = b/T then the probability of a µ-death in the box is 1 − e −4b . Thus, to prove Lemma 3.1 we want to pick c and b so that To do this we first decide to take c = 9 so that 2e −c < 2.4682 × 10 −4 , 4e −c/2 < 0.0444359. This means we need 1 − e −4b ≤ 0.229317. This holds if we take b < b 0 = (1/4) log(1/0.77069) = 0.028281. Thus we have survival if Hence by monotonicity of the survival probability we will have survival if λ 2 ≥ µ 9(3λ + 2) b 0 and 45µ/b 0 < 1 which holds if µ < 1600. If 40 √ µ > 1, then we can simply bound λ c (µ) by λ c (1), the critical value for ordinary contact process on Z 1 .

Lower bound on λ c
For some 0 < δ < 1 define M t = (AB) t + δ(A t + B t ). Here (AB) t , A t and B t are the number of sites in states AB, A, and B at time t. The idea is to show for certain values of λ, it's possible to choose the δ so that M t is a supermartingale. Since M t ≥ 0, it converges to a finite limit, which must be identically 0 since M t has values in a discrete set of values. This then implies both species have to die out with probability 1. Changes in M t results from the following • An AB becomes A or B. This decreases M t by 1 − δ and the total rate is 2µ(AB) t .
• AB or A or B gives birth creating a new AB. This increases M t by 1 − δ and the total rate is ≤ λ(A t + B t ) (note an A or B can become an AB at rate at most λ).
• An AB gives birth so that a new A or B is created. This increases M t by δ and the total rate is ≤ 2λ(AB) t .
• An A or B dies. This decreases M t by δ and the total rate is A t + B t .
• An A or B creates a new A or B. This increases M t by δ. The total rate is ≤ λ(A t + B t ).
Based on the items in the previous list, we can conclude that if F t = σ{A s , B s , (AB) s , s ≤ t}.

Improved lower bound in d = 1
Consider the symbiotic biased voter model (SBVM) starting with AB's at all integers n ≤ 0. To be precise, the birth rates for A's and B's remains the same, however, in this model only the rightmost A or B is allowed to die. Let r A (t) be the right most A and r B (t) the right most B. Each extreme particle dies at rate µ if the state there is AB or at rate 1 if the site is singly occupied. For example, in the realization drawn in Figure 4, he B at r B (t) dies at rate 1, while the A at r A (t) dies at rate µ. can be proved using the subadditive ergodic theorem. Using arguments in [10] for the one-dimensional contact process (see also [11] for the case of oriented percolation) we can also show that if we define If r A (t) < r B (t) then the right-most A and the right most B give birth at rate λ/2. Let N t = |r A (t) − r B (t)|. If N t = n > 0 and r A (t) < r B (t) then the A at r A (t) dies at rate 1, and the B at r B (t) dies at rate µ. Let q be the Q-matrix for N t .
• If n ≥ 1 then q(n, n + 1) = µ + λ/2 due to birth of an A or death of a B; q(n, n − 1) = 1 + λ/2 due to death of an A or birth of a B.

Proof of Lemma 1.6
At several points in the proof we will use Harris' result on "positive correlations." See Theorem B17 on page 9 of [24]. If ζ t is an attractive particle system starting from a deterministic initial condition and µ is the distribution at time t then for any increasing functions f and g f g dµ ≥ f dµ · g dµ (4.1) In most of our applications f = 1 A and g = 1 B will be indicator functions.
We begin our investigation by recalling some facts about the subcritical d-dimensional contact process. Let λ be the total birth rate from an occupied site and let the death rate be 1. We suppose that in the initial condition only the origin is occupied and denote the process by η 0 t . Combining Theorems 2.34 and 2.48 of [24] shows that if λ < λ c then there exists some κ(λ) < 1 so that E(|η t |) ≤ Cκ(λ) t , (4.2) for all t. By increasing the value of κ(λ) if necessary we also have P(η 0 t ever reaches ∂B 1 (0, s) for some t) ≤ Cκ(λ) s , where ∂B 1 (0, s) is the boundary of the L 1 ball of radius s in Z d centered at 0. Here L 1 . . . , x d ) and y = (y 1 , . . . , y d ). Let a be chosen so that The reason we choose an a that satisfies the above will become clear in the proof of Lemma 5.1.
Recall that R Lj ,Tj = {AB(H Lj ,Tj ) ≤ M, AB(S Tj ,Lj ) ≤ N }. Define D Lj ,Tj ,l to be the event that there are fewer than l arrows with one side occupied by A or B or AB escaping from the side of space time box, i.e., σ Lj ,Tj . Define E Lj ,Tj ,l to be the event that there are fewer than l sites in state A or B or AB on the top, W (L) × {1.01T j }.  Proof. To begin we consider equation (4.5). Observe that for any A or B reaching the outer boundary σ Lj ,Tj , that particle must have an ancestor on the inner boundary ρ Lj ,Tj s.t. the infection path from the ancestor to the descendant completely lies in the side slab S Tj ,Lj . There are two possibilities for this infection path. Either it meets a particle of the other species during the journey or not. We say the descendants of an A travel alone if they never share a site with a B individual. An individual A on ρ Lj ,Tj has probability of less than C(κ(λ)) aLj to reach σ Lj ,Tj if they travel alone and the infection path stays in the side slab. Note that due to their definitions A(ρ Lj ,Tj ) and B(ρ Lj ,Tj ) are bounded by CT j L d−1 j . Since we assume lim j→∞ T j (κ(λ)) aLj L d−1 j = 0, by union bound the probability that there exists one A or B on ρ Lj ,Tj that make it to σ Lj ,Tj by traveling alone in the side slab is bounded by C T j L d−1 j (κ(λ)) aLj , which goes to 0 as j → ∞ by assumption. Since N is fixed finite number on the event R Lj ,Tj the number of particles in the side slab that do not travel alone in the side slab is at most C N with high probability. Combining the two types of possibilities for spreading (traveling alone or not) we see the number of offspring that can reach the sides σ Lj ,Tj is also at most C N with high probability. This proves (4.5). The proof of (4.6) is similar.
Each individual dies at rate at least µ, so the probability for it to die in 1 unit of time is at least 1 − exp(−µ). The probability that this individual does not produce a new particle within 1 unit of time is at least exp(−λ). Using positive correlations, we see that on the event D Lj ,Tj ,l ∩ E Lj ,Tj ,l , there is always probability that all the births escaping from the side are killed and all the sites occupied at top slice recover before giving any birth. If we denote by F B(Lj ,Tj ) the sigma algebra generated by the Poisson process in the space-time box B(L j , T j ), then on D Lj ,Tj ,l ∩ E Lj ,Tj ,l we Levy's 0-1 law (see e.g. [14,Theorem 5.5.8]) implies that P (Ω 0 |F(L j , T j )) → 1 Ω0 , which implies on the event lim sup j→∞ D Lj ,Tj ,l ∩ E Lj ,Tj ,l we have 1 Ω0 = 1. It follows from this and the fact lim sup j→∞ P(D Lj ,Tj ,l ∩ E Lj ,Tj ,l ) ≤ P(lim sup j→∞ D Lj ,Tj ,l ∩ D Lj ,Tj ,l ) that for any l, lim sup j→∞ P(D Lj ,Tj ,l ∩ E Lj ,Tj ,l ) ≤ P(Ω 0 ). Lemma 1.6 follows because η can be taken arbitrarily small.

Proof of Lemma 1.7
In this section, our goal is to prove   There are x, y with dist(x, y) ≤ L j with an A or AB at x and a B or AB at y. If we let c 3 = e −8 (1 − e −λ/2 ) 4 and we let U Proof of Proposition 1. In scenario 1, equation (4.3) implies that a single particle x has probability at most Cκ(λ) Lj /2 to ever reach some point outside B 1 (x, L j /2). Using a union bound, we see that with probability at least 1 − C((a + h)L j ) d κ(λ) Lj none of the particles in the box will move for a distance greater than L j /2. Conditioned on the event that none of the A's and B's meet, they will die out before time L j with a probability of at least 1 − C((a + h)L j ) d κ(λ) Lj by equation (4.2). Using union bound again we get equation (5.4).
In Scenario 2, the result comes from the fact that for any A and B with distance less than L j , the probability that they will meet to form an AB within time of L j is To prove this, let z 0 = x, z 1 , . . . z k = y be a path with length ≤ L j and note that to get from z i occupied at time t to z i+1 occupied at time t+1: the particle at z i has to survive for time 1, give birth onto z i+1 and the newborn particle needs to survive until time t+1. If the AB is already in (iii) The first born particle has to survive until the second birth occurs which occurs with probability ≥ e −1 ). Then we repeat this process for the newly formed AB until we reach the final point of the path. Using positive correlations we prove (5.5) with c 3 = e −8 (1 − e −λ/(2d) ) 4 since (e −1 ((1 − e −λ/(2d) )e −1 ) Lj (e −2µ (1 − e −λ/(2d) ) 2 e −1 ) Lj > c Proof of Lemma 5.1. We divide [0, t j ] into intervals of length 5L j . Denote by t j,k the resulting division points for 1 ≤ k ≤ t j /(5L j ) By Proposition 5.2, on the event W (Lj ) ξ tj = ∅ if we look at the restricted process W (Lj ) ξ t at times t j,,k we need to stay in scenario 2 otherwise the restricted process will die with high probability. On the other hand, falling into scenario 2 implies that we will have a chance of at least c Lj 3 to get an AB in S L,T . If t j /L j is large enough so that (5.6) then with high probability the number of AB in S Lj ,tj will grow to ∞. To see this, recall that for any collection of independent Bernoulli random variables {I r } using Chebyshev's inequality with the fact that var (I r ) ≤ E(I r ) we have .
This proves (5.2). Since κ(λ) a /c 3 < 1 it is clear from the definition of t j that (5.3) holds.
Proof of Lemma 1.7. It is clear that f (L j , 0) = 1 and f (L j , t) is an decreasing function of t. We need to find T j that satisfies f (L j , T j ) = P(Ω 0 ). By comparison with Richardson's model, see [29], it follows that the SCP spreads at most linearly. Hence if T j = o(L j ) then lim j→∞ f (L j , T j ) = 1. This implies that if we have f (L j , T j ) = P(Ω 0 ), for large j, then it must be true that lim inf j→∞ T j /L j > 0. Lemma 5.1 gives us, see (5.3) and (5.2), a sequence of t j that satisfies lim j→∞ t j (κ(λ)) aLj = 0 and lim sup j→∞ f (L j , t j ) ≤ P(Ω 0 ). Since f (L j , t) is decreasing in t we have proved the existence of T j with the properties desired in Lemma 1.7. The same calculation gives for the SCP on Z d : It remains to show if we have many AB's then with high probability at some time t ≤ 1.01T we will have an box of length 2n that is filled with AB. Denote by F 1 the event that W ξ Note that by the ergodic theorem we know that P(Ω 0 ) → 0 as n → ∞, so if we pick n large enough then P(Ω 0 ) ≤ δ/2. Having chosen the value of n, we will show Lemma 6.1. P(F c 1 ∩ F 2 ) ≤ δ 1/4 for N large enough.
Proof of Lemma 6.1. Following the proof of (5.6) in [5], we will use an algorithm that will stop if we find (2n) d consecutive AB's. It is designed so that each time we choose an AB site, the probability that this chosen point fails to generates (2n) d AB's within next one unit of time is less than α which is a number only depends on n. Also whether or not we can get (2n) d AB's is independent of information obtained before. This proves that P(F c 1 ∩ F 2 ) ≤ 2(2δ) 1 4 as long as the algorithm allows us enough choices on F 2 . Let t 1 be the first time that an AB appears in S 1,+ L,T and let the coordinate of this first point by (x 1 , t 1 ). Let F 1 be the sigma-algebra generated by the Poisson processes in W up to time t 1 . Given F 1 , the probability that this chosen point fails to generates an interval of (2n) d AB's in (x 1 + [−n, n] d ) × [t 1 , t 1 + 1] using only Poisson arrivals in (x 1 + [−n, n] d ) × [t 1 , t 1 + 1] is less than α. If we do get (2n) d AB's then the algorithm stops otherwise we continue.
At the next step we try to find the first t 2 > t 1 , so that we have an AB at (x 2 , t 2 ) in S 1,+ L,T .
When t 1 ≤ t 2 ≤ t 1 + 1 we ignore points with |x 2 − x 1 | ≤ 4n. If t 2 > t 1 + 1 we let F 1 be the sigma-algebra generated by the Poisson processes in W up to time t 2 . If t 1 ≤ t 2 ≤ t 1 + 1, we need to add information about the Poisson processes in ( In either case, given F 2 , there is a probability of less than α that we cannot find (2n) d consecutive AB's by using the Poisson process in ( We continue the search until we either get (2n) d consecutive AB's or we come to time 1.01T . The probability of failure when running this algorithm for k steps is ≤ α k . This will be ≤ δ 1/4 if k > (1/4) log(δ) log(α) .
Recall that we count two space time points (y, s 1 ) and (y, s 2 ) as different AB only if |s 1 − s 2 | ≥ 1. Hence at each step of the algorithm we ignore at most (8n) d AB points. It follows that if N > (1/4) log δ log α ((8n) d + 1), then we can run the algorithm for at least 1/4(log δ)/(log α) steps if needed, which implies the probability of failure is ≤ δ 1/4 . This completes the proof of Lemma 7 and hence completes the proofof Theorem 2.

Proof of Theorem 1.5
The first step is define the dual process. For this we need to construct the process using Poisson processes. For each ordered pair of neighboring sites x, y ∈ Z d and level i we have a rate λ Poisson process T (x,y),i n , n ≥ 1 which cause births from (x, i) to (y, i). For each unordered pair of neighbors and level i we have a rate −2 Poisson process S x,y,i n , n ≥ 1 the values at (x, i) to (y, i). For each site x and level i we have a rate µ Poisson process T (x,i) n , n ≥ 1 that always causes death of a particle at x on level i, and a rate 1 − µ Poisson process S (x,i) n , n ≥ 1 that causes death of a particle at x on level i if there is no particle at x on level 1 − i.
The first three Poisson processes are part of an additive process but the last one is not, so the dual process that works backwards from x on level i at time t is what [15] call the influence set. The state at (x, i) at time t can be computed if we know the states of the sites in I x,i,t s at time t − s. When a particle in I x,i,t s hits an arrival in one of our Poisson processes the following changes occur.
• T (x,y),i n . We draw an arrow from (y, i) → (x, i) to indicate a potential birth and add a particle at (y, i). If there is already a particle at (y, i) the two particle coalesce to one.
• S x,y,i n . We draw an arrow from (x, i) → (y, i) and an arrow from (y, i) → (x, i) to indicate that the values will be exchanged. We move the particle at (x, i) to (y, i). if there is a particle at (y, i) it moves to (x, i) • T x,i n . We kill the particle at (x, i) and write a δ next to it. • S x,i n . We write a δ at (x, i) and draw an arrow from (x, 1 − i) → (x, i) to indicate that if (x, 1 − i) is occupied the particle at (x, i) is saved from death. We leave (x, i) in the dual and add a particle at (x, 1 − i).
For more details about the construction of the dual see Section 2 in [15]. In that section it is shown that the correlations of particle movements caused by stirring neighboring particles tend to 0 as → 0, so the dual converges to a branching Brownian motion. In Sections 2d and 2e of [15], the convergence of the dual to branching Brownian motion is used to conclude that the q A (t, x) and q B (t.x) converge to limits q A (t, x) and q B (t, x) that satisfy (1.9) and (1.10). This is also proved in Chapter 2 of [9]. However the fact that we have stirring instead of random walks makes things simpler: we do not have to trim the dual to remove particles that exist for only a very short amount of time.
The results of Aronson and Weinberger [2,3] imply that when λ > 1 Lemma 3.2 in [15] holds and consequently there is a nontrivial stationary distribution. Essentially the same proof is carried out in Chapter 6 of [9], but in that reference a more careful comparison with percolation is used to guarantee that the densities are close to the values that emerge from the mean-field ordinary differential equation.
To prove result (ii) we have to use a comparison with oriented percolation to show that holes (regions that are ≡ 0) grow linearly so the system dies out. In doing this we have to deal with the fact that our block event that produces dead regions sometimes fails. To guarantee that the configuration is ≡ 0 even in that case, we use another percolation argument to show that the failed block events are surrounded by a connected dead region so it is impossible for there to be particles in the region with the failed block construction. This argument is done in Sections 4 and 5 of [15] for the quadratic contact process, and in greater generality in Chapter 7 of [9].