Related papers: Competing frogs on $\mathbb{Z}^d$
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
The L\'evy walk process with rests is discussed. The jumping time is governed by an $\alpha$-stable distribution with $\alpha>1$ while a waiting time distribution is Poissonian and involves a position-dependent rate which reflects a…
We study the following microscopic model of infection or epidemic reaction: red and blue particles perform independent nearest-neighbor continuous-time symmetric random walks on the integer lattice $\mathbb{Z}$ with jump rates $D_R$ for red…
We introduce and study a simple and natural class of solvable stochastic lattice gases. This is the class of \emph{Strong Particles}. The name is due to the fact that when they try to jump to an occupied site they succeed pushing away a…
A one-dimensional driven diffusive system with two types of particles and nearest neighbors interactions has been considered on a finite lattice with open boundaries. The particles can enter and leave the system from both ends of the…
Two classes of interacting particle systems on $\mathbb{Z}$ are shown to be Pfaffian point processes at fixed times, and for all deterministic initial conditions. The first comprises coalescing and branching random walks, the second…
Chase-Escape is a simple stochastic model that describes a predator-prey interaction. In this model, there are two types of particles, red and blue. Red particles colonize adjacent empty sites at an exponential rate $\lambda_{R}$, whereas…
We consider a stochastic model, describing the growth of two competing infections on $\mathbb{R}^d$. The growth takes place by way of spherical outbursts in the infected region, an outburst in the type 1 (2) infected region causing all…
A spider consists of several, say $N$, particles. Particles can jump independently according to a random walk if the movement does not violate some given restriction rules. If the movement violates a rule it is not carried out. We consider…
Consider the graph induced by $\mathbb{Z}^d$, equipped with uniformly elliptic random conductances. At time $0$, place a Poisson point process of particles on $\mathbb{Z}^d$ and let them perform independent simple random walks. Tessellate…
In this paper, we proposed a stochastic model which describes two species of particles moving in counterflow. The model generalizes the theoretical framework describing the transport in random systems since particles can work as mobile…
We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…
We consider random walk on a finite group $G$ as follows. We can consider $G$ as a group of substitutions. Randomly (i.e. with probability $U(g)=|G|^{-1}$ ) we choose a substitution $g \in G$ and execute it twice in a row, i.e. execute a…
We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that…
Swimmers and self-propelled particles are physical models for the collective behaviour and motility of a wide variety of living systems, such as bacteria colonies, bird flocks and fish schools. Such artificial active materials are amenable…
Place one active particle at the root of a graph and a Poisson-distributed number of dormant particles at the other vertices. Active particles perform simple random walk. Once the number of visits to a site reaches a random threshold, any…
This paper investigates the long-time behavior of double branching annihilating random walkers with nearest-neighbor dependent rates. The system consists of even number of particles which can execute nearest-neighbor random walk and they…
We consider a branching random walk in time-inhomogeneous random environment, in which all particles at generation $k$ branch into the same random number of particles $\mathcal{L}_{k+1}\ge 2$, where the $\mathcal{L}_k$, $k\in\mathbb{N}$,…
We consider $d$ random walks $\big(S_n^{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n)_{n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that,…
We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al. 2009), online nodes have types in our model. In contrast to…