Related papers: On the range of the transient frog model on Z

We examine a system of interacting random walks with leftward drift on $\mathbb{Z}$, which begins with a single active particle at the origin and some distribution of inactive particles on the positive integers. Inactive particles become…

We study the frog model on $\mathbb{Z}^d$ with drift in dimension $d \geq 2$ and establish the existence of transient and recurrent regimes depending on the transition probabilities. We focus on a model in which the particles perform…

We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. Each active particle performs a simple random walk with…

We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…

In this paper we present a recurrence criterion for the frog model on $\mathbb{Z}^d$ with an i.i.d. initial configuration of sleeping frogs and such that the underlying random walk has a drift to the right.

We consider the interacting particle system on the homogeneous tree of degree $(d + 1)$, known as frog model. In this model, active particles perform independent random walks, awakening all sleeping particles they encounter, and dying after…

The frog model is an interacting particle system on a graph. Active particles perform independent simple random walks, while sleeping particles remain inert until visited by an active particle. Some number of sleeping particles are placed…

Consider a Poisson process on $\mathbb{R}$ with intensity $f$ where $0 \leq f(x)<\infty$ for ${x}\geq 0$ and ${f(x)}=0$ for $x<0$. The "points" of the process represent sleeping frogs. In addition, there is one active frog initially located…

We consider a random interacting particle system, known as the frog model, on infinite Galton-Watson trees allowing offspring zero and one. The system starts with one awake particle (frog) at the root of the tree and a random number of…

We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog…

In this paper, we show that the first passage time in the frog model on $\Z^d$ with $d\geq 2$ has a sublinear variance. This implies that the central limit theorem does not holds at least with the standard diffusive scaling. The proof is…

We provide a uniform upper bound on the minimal drift so that the one-per-site frog model on a $d$-ary tree is recurrent. To do this, we introduce a subprocess that couples across trees with different degrees. Finding couplings for frog…

We study the recurrence of one-per-site frog model $\text{FM}(d, p)$ on a $d$-ary tree with drift parameter $p\in [0,1]$, which determines the bias of frogs' random walks. We are interested in the minimal drift $p_{d}$ so that the frog…

In this article we consider the frog model with drift on $\mathbb{Z}$ and investigate the behaviour of the cloud of the frogs. In particular, we show that the speed of the minimum equals the speed of a single frog and prove some properties…

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 consider transient random walks on free products of graphs. We prove that the asymptotic range of these random walks exists and is strictly positive. In particular, we show that the range varies real-analytically in terms…

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 consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…

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…

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…