Related papers: Competition on $\mathbb{Z}^d$ driven by branching …
The goal of this note is to prove a law of large numbers for the empirical speed of a green particle that performs a random walk on top of a field of red particles which themselves perform independent simple random walks on $\Z^d$, $d \geq…
We study a two-species competition model in a patchy advective environment, where the species are subject to both directional drift and undirectional random dispersal between patches and there are losses of individuals in the downstream end…
The branching random walk is shown to be monotone decreasing in ascending direction of integer lattices as a corollary of an observation in regard to the lineage of particles from antisymmetric initial states, and a related property of…
We define a general class of models representing natural selection between two alleles. The population size and spatial structure are arbitrary, but fixed. Genetics can be haploid, diploid, or otherwise; reproduction can be asexual or…
Using Monte Carlo simulations we have studied the transition from an "active" steady state to an absorbing "inactive" state for two versions of the branching annihilating random walks with parity conservation on a square lattice. In the…
We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
Multiple teams participate in a random competition. In each round the winner receives one point. We study the times until ties occur among teams. We construct martingales and supermartingales that enable us to prove the results regarding…
By decomposing the random walk path, we construct a multitype branching process with immigration in random environment for corresponding random walk with bounded jumps in random environment. Then we give two applications of the branching…
This work is concerned with the large time behavior of the solutions of a parabolic-ODE hybrid system, modeling the competition of two populations which are identical except their movement behaviors: one species moves by random dispersal…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
We consider incidences among colored sets of lines in $\mathbb{R}^d$ and examine whether the existence of certain concurrences between lines of $k$ colors force the existence of at least one concurrence between lines of $k+1$ colors. This…
Vizing's theorem states that any graph of maximum degree $\Delta$ can be properly edge colored with at most $\Delta+1$ colors. In the online setting, it has been a matter of interest to find an algorithm that can properly edge color any…
We consider a continuous-time symmetric branching random walk on the $d$-dimensional lattice, $d\ge 1$, and assume that at the initial moment there is one particle at every lattice point. Moreover, we assume that the underlying random walk…
We study infection spread among biased random walks on $\mathbb{Z}^{d}$. The random walks move independently and an infected particle is placed at the origin at time zero. Infection spreads instantaneously when particles share the same site…
We propose a model of run-and-tumble particles (RTPs) on a line with a fertile site at the origin. After going through the fertile site, a run-and-tumble particle gives rise to new particles until it flips direction. The process of creation…
The lonely branching random walks on ${\mathbb Z}^d$ is an interacting particle system where each particle moves as an independent random walk and undergoes critical binary branching when it is alone. We show that if the symmetrized walk is…
Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…
We study an interacting system of competing particles on the real line. Two populations of positive and negative particles evolve according to branching Brownian motion. When opposing particles meet, their charges neutralize and the…