English
Related papers

Related papers: Competing frogs on $\mathbb{Z}^d$

200 papers

We study coexistence in discrete time multi-type frog models. We first show that for two types of particles on $\mathbb{Z}^d$, for $d\geq2$, for any jumping parameters $p_1, p_2 \in (0,1)$, coexistence occurs with positive probability for…

Probability · Mathematics 2024-02-23 Rishideep Roy , Kumarjit Saha

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…

Probability · Mathematics 2007-05-23 O. S. M. Alves , F. P. Machado , S. Yu. Popov , K. Ravishankar

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…

Probability · Mathematics 2019-06-12 Tobias Johnson , Leonardo T. Rolla

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…

Probability · Mathematics 2019-03-05 O. S. M. Alves , F. P. Machado , S. Yu. Popov

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…

Probability · Mathematics 2017-07-26 Josh Rosenberg

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…

Probability · Mathematics 2019-12-24 Maria Deijfen , Sebastian Rosengren

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…

Probability · Mathematics 2023-05-03 Viktor Bezborodov , Tyll Krueger

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…

Probability · Mathematics 2026-01-14 Naoki Kubota

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…

Probability · Mathematics 2024-04-01 Van Hao Can , Naoki Kubota , Shuta Nakajima

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…

Probability · Mathematics 2019-09-25 Tobias Johnson , Matthew Junge

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.…

Probability · Mathematics 2026-02-10 Ryoki Fukushima , Naoki Kubota

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…

Probability · Mathematics 2020-01-29 Elcio Lebensztayn , Mario Andres Estrada

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…

Probability · Mathematics 2017-02-08 Josh Rosenberg

A competition process on $\mathbb{Z}^d$ is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring…

Probability · Mathematics 2022-03-29 Maria Deijfen , Timo Vilkas

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…

Probability · Mathematics 2007-05-23 O. S. M. Alves , S. Yu. Popov , F. P. Machado

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…

Probability · Mathematics 2022-10-12 Gustavo O. de Carvalho , Fábio P. Machado

We consider the continuous-time frog model on $\mathbb{Z}$. At time $t = 0$, there are $\eta (x)$ particles at $x\in \mathbb{Z}$, each of which is represented by a random variable. In particular, $(\eta(x))_{x \in \mathbb{Z} }$ is a…

Probability · Mathematics 2023-09-28 Viktor Bezborodov , Luca Di Persio , Peter Kuchling

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…

Probability · Mathematics 2021-04-27 Christian Döbler , Nina Gantert , Thomas Höfelsauer , Serguei Popov , Felizitas Weidner

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…

Probability · Mathematics 2025-12-04 Gustavo O. de Carvalho , Fábio P. Machado

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…

Probability · Mathematics 2018-02-27 Jonathan Hermon
‹ Prev 1 2 3 10 Next ›