Related papers: Branching annihilating random walk on random regul…

We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…

The subject of this paper is the simple random walk on $\mathbb{Z}$. We give a very simple answer to the following problem: under the condition that a random walk has already spent $\alpha$-percent of the traveling time on the positive side…

Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has…

The edge-reinforced random walk (ERRW) is a random process on the vertices of a graph that is more likely to cross the edges it has visited in the past. Depending on the strength of the reinforcement, the ERRW of a single particle can…

We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…

We study statistical properties of a one dimensional infinite system of coalescing particles. Each particle moves with constant velocity $\pm v$ towards its closest neighbor and merges with it upon collision. We propose a mean-field theory…

We revisit the problem of deriving the mean-field values of avalanche critical exponents in systems with absorbing states. These are well-known to coincide with those of an un-biased branching process. Here, we show that for at least 4…

The branching ratio for the rare two-body B_s -> rho gamma decay is calculated using the factorization assumption. This transition is dominated by the annihilation diagrams and, in principle, prone to receiving substantial contributions…

We study an infinite system of moving particles, where each particle is of type A or B. Particles perform independent random walks at rates D_A>0 and D_B>0, and the interaction is given by mutual annihilation A+B->0. The initial condition…

We study a dynamical system motivated by our earlier work on the statistical physics of social balance on graphs that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a…

Totally asymmetric simple exclusion processes on lattices with junctions, where particles interact with hard-core exclusion and move on parallel lattice branches that at the junction combine into a single lattice segment, are investigated.…

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

We consider a modification of classical branching random walk, where we add i.i.d. perturbations to the positions of the particles in each generation. In this model, which was introduced and studied by Bandyopadhyay and Ghosh (2023),…

The phase transitions to absorbing states of the branching-annihilating reaction-diffusion processes mA --> (m+k)A, nA --> (n-l)A are studied systematically in one space dimension within a new family of models. Four universality classes of…

We study the limit behaviour of a class of random walk models taking values in the $d$-dimensional unit standard simplex, $d\ge 1$, defined as follows. From an interior point $z$, the process chooses one of the $d+1$ vertices of the…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

Let ${Z_{n},n\geq 0} $ be a critical branching process in random environment and let $T$ be its moment of extinction. Under the annealed approach we prove, as $n\to \infty ,$ a limit theorem for the number of particles in the process at…

Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

We develop a model for a random walker with long-range hops on general graphs. This random multi-hopper jumps from a node to any other node in the graph with a probability that decays as a function of the shortest-path distance between the…