A particle system with cooperative branching and coalescence

  title={A particle system with cooperative branching and coalescence},
  author={Anja Sturm and Jan M. Swart},
  journal={arXiv: Probability},
In this paper, we introduce a one-dimensional model of particles performing independent random walks, where only pairs of particles can produce offspring ("cooperative branching"), and particles that land on an occupied site merge with the particle present on that site ("coalescence"). We show that the system undergoes a phase transition as the branching rate is increased. For small branching rates, the upper invariant law is trivial, and the process started with finitely many particles a.s… 

Figures from this paper

Recursive tree processes and the mean-field limit of stochastic flows
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems
Dualities and genealogies in stochastic population models
In the thesis, population processes are studied in two different settings. In Part I, which arose in collaboration with Dr. Jan Swart, a so-called cooperative branching process is considered. We
Branching processes with interactions: subcritical cooperative regime
Abstract In this paper, we introduce a family of processes with values on the nonnegative integers that describes the dynamics of populations where individuals are allowed to have different types of
Deposition, diffusion, and nucleation on an interval
Motivated by nanoscale growth of ultra-thin films, we study a model of deposition, on an interval substrate, of particles that perform Brownian motions until any two meet, when they nucleate to form
Collision Times of Random Walks and Applications to the Brownian Web
Convergence of directed forests, spanning on random subsets of lattices or on point processes, towards the Brownian web has made the subject of an abundant literature, a large part of which relies on
Branching processes with pairwise interactions
In this manuscript, we are interested on the long-term behaviour of branching processes with pairwise interactions (BPI-processes). A process in this class behaves as a pure branching process with
A spatial model for selection and cooperation
It is proved that the one-dimensional nearest-neighbor interacting dynamical system exhibits a phase transition at α = γ, which means that for α > γ cooperators always die out, but if γ > α, cooperation is the winning strategy.
Equilibrium interfaces of biased voter models
A one-dimensional interacting particle system is said to exhibit interface tightness if starting in an initial condition describing the interface between two constant configurations of different
A Course in Interacting Particle Systems
These lecture notes give an introduction to the theory of interacting particle systems. The main subjects are the construction using generators and graphical representations, the mean field limit,
Pathwise Duals of Monotone and Additive Markov Processes
This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values


Contact processes in several dimensions
This paper deals primarily with the basic contact processes introduced and studied by Harris [12t4] . These are random evolutions on the state space S={a l l subsets of Z a} (Zd=the d-dimensional
Branching-coalescing particle systems
Abstract.We study the ergodic behavior of systems of particles performing independent random walks, binary splitting, coalescence and deaths. Such particle systems are dual to systems of linearly
Branching annihilating random walk (BARW) is a generic term for a class of interacting particle systems on $\mathbb{Z}^d$ in which, as time evolves, particles execute random walks, produce offspring
A long range sexual reproduction process
Asymptotics for interacting particle systems onZd
SummaryTwo of the simplest interacting particle systems are the coalescing random walks and the voter model. We are interested here in the asymptotic density and growth of these systems ast→∞. More
Universality class of the pair contact process with diffusion.
The pair contact process with diffusion is studied with a standard Monte Carlo approach and with simulations at fixed densities, and it is concluded that the PCPD falls in the same universality class as DP.
Ordered Random Walks
We construct the conditional version of $k$ independent and identically distributed random walks on $R$ given that they stay in strict order at all times. This is a generalisation of so-called
Markov chains and mixing times
For our purposes, a Markov chain is a (finite or countable) collection of states S and transition probabilities pij, where i, j ∈ S. We write P = [pij] for the matrix of transition probabilities.
Random Walk: A Modern Introduction
This text meets the need for a modern reference to the detailed properties of an important class of random walks on the integer lattice and is suitable for probabilists, mathematicians working in related fields, and for researchers in other disciplines who use random walks in modeling.
Noninvadability implies noncoexistence for a class of cancellative systems
There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a