Related papers: The asymptotic shape theorem for the frog model on…
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…
We prove a shape theorem for a growing set of simple random walks on Z^d, known as frog model. The dynamics of this process is described as follows: There are active particles, which perform independent discrete time SRWs, and sleeping…
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…
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…
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…
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
In this work we prove a shape theorem for a growing set of Simple Random Walks (SRWs), known as frog model. The dynamics of this process is described as follows: There are some active particles, which perform independent SRWs, and sleeping…
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…
In this note, we consider the frog model on $\mathbb{Z}^d$ and a two-type version of it with two types of particles. For the one-type model, we show that the asymptotic shape does not depend on the initially activated set and the…
We introduce an extension of the frog model to Euclidean space and prove properties for the spread of active particles. Fix $r>0$ and place a particle at each point $x$ of a unit intensity Poisson point process $\mathcal P \subseteq \mathbb…
The frog model is an infection process in which dormant particles begin moving and infecting others once they become infected. We show that on the rooted $d$-ary tree with particle density $\Omega(d^2)$, the set of visited sites contains a…
The frog model with a Bernoulli initial configuration is an interacting particle system on the $d$-dimensional lattice ($d \geq 2$) with two types of particles: active and sleeping. Active particles perform independent simple random walks.…
We consider a slight modification of the frog model. For a given graph, each vertex has $\mathrm{Poisson}(\lambda)$ particles (or frogs). At time zero, only the particles at the origin are active, and all the other particles are sleeping.…
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…
The aim of this work is to demonstrate that the continuous-time frog model can spread arbitrary fast. The set of sites visited by an active particle can become infinite in a finite time.
We consider an interacting particle system on trees known as the frog model: initially, a single active particle begins at the root and i.i.d.~$\mathrm{Poiss}(\lambda)$ many inactive particles are placed at each non-root vertex. Active…
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 consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous time simple random walk on the d-dimensional lattice. These particles are called A-particles and move independently…
We study the contact process in a dynamical random environment defined on the vertices and edges of a graph. For a broad class of processes, we establish an asymptotic shape theorem for the set H_t, which represents the vertices that have…
We study a system of simple random walks on $\mathcal{T}_{d,n} = \mathcal{V}_{d,n}, \mathcal{E}_{d,n})$, the $d$-ary tree of depth $n$, known as the frog model. Initially there are Pois($\lambda$) particles at each site, independently, with…