Related papers: Branching annihilating random walk on random regul…
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…
This paper studies systems of particles following independent random walks and subject to annihilation, binary branching, coalescence, and deaths. In the case without annihilation, such systems have been studied in our 2005 paper…
Double (or parity conserving) branching annihilating random walk, introduced by Sudbury in '90, is a one-dimensional non-attractive particle system in which positive and negative particles perform nearest neighbor hopping, produce two…
Branching processes are widely used to model the viral epidemic evolution. For more adequate investigation of viral epidemic modelling, we suggest to apply branching processes with transport of particles usually called branching random…
Let $T$ be the regular tree in which every vertex has exactly $d\ge 3$ neighbours. Run a branching random walk on $T$, in which at each time step every particle gives birth to a random number of children with mean $d$ and finite variance,…
We consider a system of particles undergoing the branching and annihilating reactions A -> (m+1)A and A + A -> 0, with m even. The particles move via long-range Levy flights, where the probability of moving a distance r decays as…
It is a common practice to describe branching random walks in terms of birth, death and walk of particles, which makes it easier to use them in different applications. The main results obtained for the models of symmetric continuous-time…
We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
We study the distribution of the maximal displacement of particles positions for the whole time of the population existence in the model of critical and subcritical catalytic branching random walk on Z. In particular, we prove that in the…
We consider a branching random walk for which the maximum position of a particle in the n'th generation, M_n, has zero speed on the linear scale: M_n/n --> 0 as n --> infinity. We further remove ("kill") any particle whose displacement is…
We consider the branching random walk in random environment with a random absorption wall. When we add this barrier, we discuss some topics related to the survival probability. We assume that the random environment is i.i.d., $S_i$ is a…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
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…
We implement a discretization of the one-dimensional branching Brownian motion in the form of a Monte Carlo event generator, designed to efficiently produce ensembles of realizations in which the rightmost lead particle at the final time…
We consider a Branching Random Walk on $\R$ whose step size decreases by a fixed factor, $0<b<1$, with each turn. This process generates a random probability measure on $\R$, that is, the limit of uniform distribution among the $2^n$…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
We study nearest-neighbors branching random walks started from a point at the interior of a hypercube. We show that the probability that the process escapes the hypercube is monotonically decreasing with respect to the distance of its…
Given a supercritical branching random walk $\{Z_n\}_{n\geq 0}$ on $\mathbb{R}$, let $Z_n([y,\infty))$ be the number of particles located in $[y,\infty)\subset\mathbb{R}$ at generation $n$. Let $m$ be the mean of the offspring law of…