We study a discrete time interacting particle system which can be considered as an annihilating branching process on where at each time every particle either performs a jump as a nearest neighbor random walk, or splits (with probability [var epsilon]) into two particles which will occupy the nearest neighbor sites. Furthermore, if two particles come to the same site, then they are removed from the system. We show that if the branching probability [var epsilon]>0 is small enough, and the number of particles at initial time is finite, then the surviving probability, i.e. the probability p(t) that there is at least one particle at time t decays to zero exponentially fast. This result is applied to a nonlinear discrete time voter model (in a ra...
We study analytically the order and gap statistics of particles at time t for the one dimensional br...
We consider Markov processes n $ c Z d in which (i) particles die at rate S 2 0, (ii) births from x ...
Abstract. Recently, Takayasu and Tretyakov studied branching annihilating random walks with n = 1-5 ...
In this work we study linear and non-linear multi-state voter models which evolve in discrete time. ...
In this paper, we introduce a one-dimensional model of particles performing independent random walks...
We study the ergodic behavior of systems of particles performing independent random walks, binary sp...
Branching annihilating random walk (BARW) is a generic term for a class of interacting particle syst...
AbstractLet p(x, y) be the transition probability of an isotropic random walk on a tree, where each ...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
We consider Markov processes [eta]t [subset of] d in which (i) particles die at rate [delta] [greate...
AbstractWe consider Markov processes ηt ⊂ Zd in which (i) particles die at rate δ ⩾ 0, (ii) births f...
The aim of this paper is to study the large population limit of a binary branching particle system w...
Branching Brownian motion is a random particle system which incorporates both the tree-like structur...
Abstract. We study a model of growing population that competes for resources. At each time step, all...
We consider a model of a discrete time “interacting particle system ” on the integer line where in-f...
We study analytically the order and gap statistics of particles at time t for the one dimensional br...
We consider Markov processes n $ c Z d in which (i) particles die at rate S 2 0, (ii) births from x ...
Abstract. Recently, Takayasu and Tretyakov studied branching annihilating random walks with n = 1-5 ...
In this work we study linear and non-linear multi-state voter models which evolve in discrete time. ...
In this paper, we introduce a one-dimensional model of particles performing independent random walks...
We study the ergodic behavior of systems of particles performing independent random walks, binary sp...
Branching annihilating random walk (BARW) is a generic term for a class of interacting particle syst...
AbstractLet p(x, y) be the transition probability of an isotropic random walk on a tree, where each ...
We propose two models of the evolution of a pair of competing populations. Both are lattice based. T...
We consider Markov processes [eta]t [subset of] d in which (i) particles die at rate [delta] [greate...
AbstractWe consider Markov processes ηt ⊂ Zd in which (i) particles die at rate δ ⩾ 0, (ii) births f...
The aim of this paper is to study the large population limit of a binary branching particle system w...
Branching Brownian motion is a random particle system which incorporates both the tree-like structur...
Abstract. We study a model of growing population that competes for resources. At each time step, all...
We consider a model of a discrete time “interacting particle system ” on the integer line where in-f...
We study analytically the order and gap statistics of particles at time t for the one dimensional br...
We consider Markov processes n $ c Z d in which (i) particles die at rate S 2 0, (ii) births from x ...
Abstract. Recently, Takayasu and Tretyakov studied branching annihilating random walks with n = 1-5 ...