Related papers: Competition on $\mathbb{Z}^d$ driven by branching …
We consider a two-type stochastic competition model on the integer lattice Z^d. The model describes the space evolution of two ``species'' competing for territory along their boundaries. Each site of the space may contain only one…
We study a model of competition between two types evolving as branching random walks on $\mathbb{Z}^d$. The two types are represented by red and blue balls respectively, with the rule that balls of different colour annihilate upon contact.…
We study the following one-dimensional model of annihilating particles. Beginning with all sites of $\mathbb{Z}$ uncolored, a blue particle performs simple random walk from $0$ until it reaches a nonzero red or uncolored site, and turns…
A two-type version of the frog model on $\mathbb{Z}^d$ is formulated, where active type $i$ particles move according to lazy random walks with probability $p_i$ of jumping in each time step ($i=1,2$). Each site is independently assigned a…
We review recent results obtained from simple individual-based models of biological competition in which birth and death rates of an organism depend on the presence of other competing organisms close to it. In addition the individuals…
We consider a two-type oriented competition model on the first quadrant of the two-dimensional integer lattice. Each vertex of the space may contain only one particle of either Red type or Blue type. A vertex flips to the color of a…
In this paper, we describe a process where two types of particles, marked by the colors red and blue, arrive in a domain $D$ at a constant rate and are to be matched to each other according to the following scheme. At the time of arrival of…
This paper investigates the coexistence of two competing species on random geometric graphs (RGGs) in continuous time. The species grow by occupying vacant sites according to Richardson's model, while simultaneously competing for occupied…
We consider two independent branching random walks that start next to each other on the $d$-dimensional hypercubic lattice and that carry two different colors. Vertices of the lattice are colored according to the color of the walker cloud…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We study the macroscopic geometry of first-passage competition on the integer lattice $Z^d$, with a particular interest in describing the behavior when one species initially occupies the exterior of a cone. First-passage competition is a…
We study a continuous time Mutually Catalytic Branching model on the $\mathbb{Z}^{d}$. The model describes the behavior of two different populations of particles, performing random walk on the lattice in the presence of branching, that is,…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…
We propose two models of the evolution of a pair of competing populations. Both are lattice based. The first is a compromise between fully spatial models, which do not appear amenable to analytic results, and interacting particle system…
We study a competitive stochastic growth model called chase-escape in which red particles spread to adjacent uncolored sites and blue only to adjacent red sites. Red particles are killed when blue occupies the same site. If blue has rate-1…
We consider a continuous-time branching random walk on a multidimensional lattice with two types of particles and an infinite number of initial particles. The main results are devoted to the study of the generating function and the limiting…
We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…
We consider a branching random walk on $\Z$, where the particles behave differently in visited and unvisited sites. Informally, each site on the positive half-line contains initially a cookie. On the first visit of a site its cookie is…
We consider a population of particles with unit life length. Dying each particle produces offspring whose size depends on the random environment specifying the reproduction law of all particles of the given generation and on the number of…