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

We derive a lower bound for the probability that a random walk with i.i.d.\ increments and small negative drift $\mu$ exceeds the value $x>0$ by time $N$. When the moment generating functions are bounded in an interval around the origin,…

A two-type version of the frog model on $\mathbb{Z}^d$ is formulated, where active type $i$ particles move according to lazy random walks with probability $p_i$ of jumping in each time step ($i=1,2$). Each site is independently assigned a…

We study critical branching random walks (BRWs) $U^{(n)}$ on~$\mathbb{Z}_{+}$ where for each $n$, the displacement of an offspring from its parent has drift~$2\beta/\sqrt{n}$ towards the origin and reflection at the origin. We prove that…

Let $\mathbb{T}$ denote a rooted $b$-ary tree and let $\{S_v\}_{v\in \mathbb{T}}$ denote a branching random walk indexed by the vertices of the tree, where the increments are i.i.d. and possess a logarithmic moment generating function…

Drift analysis aims at translating the expected progress of an evolutionary algorithm (or more generally, a random process) into a probabilistic guarantee on its run time (hitting time). So far, drift arguments have been successfully…

We consider a system of particles performing a one-dimensional dyadic branching Brownian motion with space-dependent branching rate, negative drift $-\mu$ and killed upon reaching $0$, starting with $N$ particles. More precisely, particles…

We consider the correlations and the hydrodynamic description of random walkers with a general finite memory moving on a $d$ dimensional hypercubic lattice. We derive a drift-diffusion equation and identify a memory-dependent critical…

We consider a discrete-time branching random walk defined on the real line, which is assumed to be supercritical and in the boundary case. It is known that its leftmost position of the $n$-th generation behaves asymptotically like…

Consider the following interacting particle system on the $d$-ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake…

The frog model is a branching random walk on a graph in which particles branch only at unvisited sites. Consider an initial particle density of $\mu$ on the full $d$-ary tree of height $n$. If $\mu= \Omega( d^2)$, all of the vertices are…

We study a class of discrete-time random walks in $\mathbb{R}^d$ whose conditional drift decays polynomially in time and grows polynomially with the distance from the origin to the current position. This class is related to several models…

We examine an interacting particle system on trees commonly referred to as the frog model. For its initial state, it begins with a single active particle at the root and i.i.d. $\mathrm{Poiss}(\lambda)$ many inactive particles at each…

In this article, we study the maximal displacement of critical branching random walk in random environment. Let $M_n$ be the maximal displacement of a particle in generation $n$, and $Z_n$ be the total population in generation $n$, $M$ be…

The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…

Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…

We consider the frog model with geometric lifetime (parameter $1-p$) on homogeneous trees of dimension $d$. In 2002, \cite{alves2002-2} proved that there exists a critical lifetime parameter $p_c\in(0,1)$ above which infinitely many frogs…

The frog model starts with one active particle at the root of a graph and some number of dormant particles at all nonroot vertices. Active particles follow independent random paths, waking all inactive particles they encounter. We prove…

For a supercritical catalytic branching random walk on Z^d (d is positive integer) with an arbitrary finite catalysts set we study the spread of particles population as time grows to infinity. Namely, we divide by t the position coordinates…

On the rooted $k$-ary tree we consider a 0-1 kinetically constrained spin model in which the occupancy variable at each node is re-sampled with rate one from the Bernoulli(p) measure iff all its children are empty. For this process the…

For the last ten years, almost every theoretical result concerning the expected run time of a randomized search heuristic used drift theory, making it the arguably most important tool in this domain. Its success is due to its ease of use…