Related papers: Explosion and non-explosion for the continuous-tim…
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…
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…
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…
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…
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 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 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…
The frog model is a system of random walks where active particles set sleeping particles in motion. On the complete graph with n vertices it is equivalent to a well-understood rumor spreading model. We given an alternate and elementary…
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…
First we establish explosion criteria for jump processes with an arbitrary locally compact separable metric state space. Then these results are applied to two stochastic coagulation-fragmentation models--the direct simulation model and the…
We study the frog model on \( \mathbb{Z} \) with geometric lifetimes, introducing a random survival parameter. Active and inactive particles are placed at the vertices of \( \mathbb{Z} \). The lifetime of each active particle follows a…
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.…
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…
We consider the frog model with Bernoulli initial configuration, which is an interacting particle system on the multidimensional lattice consisting of two states of particles: active and sleeping. Active particles perform independent simple…
Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…
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…
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 consider the so-called frog model with random initial configurations. The dynamics of this model is described as follows: Some particles are randomly assigned on any site of the multidimensional cubic lattice. Initially, only particles…
We investigate the weighted scale-free percolation (SFPW) model on $\mathbb Z^d$. In the SFPW model, the vertices of $\mathbb Z^d$ are assigned i.i.d. weights $(W_x)_{x\in \mathbb Z^d}$, following a power-law distribution with tail exponent…
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…