Related papers: Stochastic orders and the frog model
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 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 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…
We study the frog model on Cayley graphs of groups with polynomial growth rate $D \geq 3$. The frog model is an interacting particle system in discrete time. We consider that the process begins with a particle at each vertex of the graph…
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 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…
Place an active particle at the root of the infinite $d$-ary tree and dormant particles at each non-root site. Active particles move towards the root with probability $p$ and otherwise move to a uniformly sampled child vertex. When an…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
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 study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…
Mechanisms of pattern formation---of which the Turing instability is an archetype---constitute an important class of dynamical processes occurring in biological, ecological and chemical systems. Recently, it has been shown that the Turing…
The asymptotic behavior of a stochastic network represented by a birth and death processes of particles on a compact state space is analyzed. Births: Particles are created at rate $\lambda_+$ and their location is independent of the current…
In this paper, a link between monotonicity of deterministic dynamical systems and propagation of order by Markov processes is established. The order propagation has received considerable attention in the literature, however, this notion is…
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.
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 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…
We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…
We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities between items. Items of different classes arrive one by one…
We study stochastic monotonicity and propagation of order for Markov processes with respect to stochastic integral orders characterized by cones of functions satisfying $\Phi f \geq 0$ for some linear operator $\Phi$. We introduce a new…
Stochastic monotonicity is a well known partial order relation between probability measures defined on the same partially ordered set. Strassen Theorem establishes equivalence between stochastic monotonicity and the existence of a coupling…