English
Related papers

Related papers: Critical drift estimates for the frog model on tre…

200 papers

Consider a supercritical branching random walk on the real line. The consistent maximal displacement is the smallest of the distances between the trajectories followed by individuals at the $n$th generation and the boundary of the process.…

Probability · Mathematics 2019-05-21 Bastien Mallein

The motion of a particle in a correlated random potential under the influence of a driving force is investigated in mean field theory. The correlations of the disorder are characterized by a short distance cutoff and a power law decay with…

Condensed Matter · Physics 2009-10-28 Heinz Horner

Let $F(N,m)$ denote a random forest on a set of $N$ vertices, chosen uniformly from all forests with $m$ edges. Let $F(N,p)$ denote the forest obtained by conditioning the Erdos-Renyi graph $G(N,p)$ to be acyclic. We describe scaling limits…

Probability · Mathematics 2018-07-04 James Martin , Dominic Yeo

We consider a two type (red and blue or $R$ and $B$) particle population that evolves on the $d$-dimensional lattice according to some reaction-diffusion process $R+B\to 2R$ and starts with a single red particle and a density $\rho$ of blue…

Probability · Mathematics 2009-01-07 A. Gaudilliere , F. R. Nardi

We consider branching Brownian motion in which initially there is one particle at $x$, particles produce a random number of offspring with mean $m+1$ at the time of branching events, and each particle branches at rate $\beta = 1/2m$.…

Probability · Mathematics 2023-10-03 Pascal Maillard , Jason Schweinsberg

We study the thick points of branching Brownian motion and branching random walk with a critical branching mechanism, focusing on the critical dimension $d = 4$. We determine the exponent governing the probability to hit a small ball with…

Probability · Mathematics 2025-12-01 Nathanaël Berestycki , Tom Hutchcroft , Antoine Jego

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

Combinatorics · Mathematics 2010-09-27 Omer Angel , Alexander E. Holroyd

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

Probability · Mathematics 2017-07-06 Yueyun Hu

It is well-known that the maximal particle in a branching Brownian motion sits near $\sqrt2 t - \frac{3}{2\sqrt2}\log t$ at time $t$. One may then ask about the paths of particles near the frontier: how close can they stay to this critical…

Probability · Mathematics 2014-06-20 Matthew I. Roberts

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…

Probability · Mathematics 2008-04-26 Jozsef Balogh , Yuval Peres , Gabor Pete

We study a system of random walks, known as the frog model, starting from a profile of independent Poisson($\lambda$) particles per site, with one additional active particle planted at some vertex $\mathbf{o}$ of a finite connected simple…

Probability · Mathematics 2025-07-08 Itai Benjamini , Luiz Renato Fontes , Jonathan Hermon , Fabio Prates Machado

Activated Random Walks, on $\mathbb{Z}^d$ for any $d\geqslant 1$, is an interacting particle system, where particles can be in either of two states: active or frozen. Each active particle performs a continuous-time simple random walk during…

Probability · Mathematics 2024-09-04 Amine Asselah , Nicolas Forien , Alexandre Gaudillière

We consider branching Brownian motion on the real line with absorption at zero, in which particles move according to independent Brownian motions with the critical drift of $-\sqrt{2}$. Kesten (1978) showed that almost surely this process…

Probability · Mathematics 2012-12-19 Julien Berestycki , Nathanael Berestycki , Jason Schweinsberg

Let $\{Z_{m},m\geq 0\}$ be a critical branching process in random environment and $\{S_{m},m\geq 0\}$ be its associated random walk. Assuming that the increments distribution of the associated random walk belongs without centering to the…

Probability · Mathematics 2025-12-30 Vladimir Vatutin , Elena Dyakonova

Consider a growing system of random walks on the 3,2-alternating tree, where generations of nodes alternate between having two and three children. Any time a particle lands on a node which has not been visited previously, a new particle is…

Probability · Mathematics 2017-07-14 Josh Rosenberg

We consider a discrete-time process adapted to some filtration which lives on a (typically countable) subset of $\mathbb{R}^d$, $d\geq 2$. For this process, we assume that it has uniformly bounded jumps, is uniformly elliptic (can advance…

Probability · Mathematics 2014-04-28 Mikhail Menshikov , Serguei Popov

Consider a stochastic growth model on $\mathbb{Z} ^d$. Start with some active particle at the origin and sleeping particles elsewhere. The initial number of particles at $x \in \mathbb{Z} ^d$ is $\eta(x)$, where $\eta (x)$ are independent…

Probability · Mathematics 2023-05-03 Viktor Bezborodov , Tyll Krueger

Consider branching Brownian motion in which we begin with one particle at the origin, particles independently move according to Brownian motion, and particles split into two at rate one. It is well-known that the right-most particle at time…

Probability · Mathematics 2024-06-10 Julien Berestycki , Jiaqi Liu , Bastien Mallein , Jason Schweinsberg

We study the existence and the exponential ergodicity of a general interacting particle system, whose components are driven by independent diffusion processes with values in an open subset of $\mathds{R}^d$, $d\geq 1$. The interaction…

Probability · Mathematics 2010-12-01 Denis Villemonais

We consider a Brownian motion with linear drift that splits at fixed time points into a fixed number of branches, which may depend on the branching point. For this process, which we shall refer to as the Brownian decision tree, we…

Probability · Mathematics 2025-12-08 Krzysztof Dȩbicki , Pavel Ievlev , Nikolai Kriukov