The shape theorem for the frog model with random initial configuration

Abstract

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 particles, which do not move. When a sleeping particle is hit by an active particle, the former becomes active as well. Initially, a random number of particles is placed into each site. At time 0 all particles are sleeping, except for those placed at the origin. We prove that the set of all sites visited by active particles, rescaled by the elapsed time, converges to a compact convex set.

References in corpus (1)

• Phase transition for the frog model

Cited by in corpus (11)

• Phase transition for the frog model
• From transience to recurrence with Poisson tree frogs
• A new upper bound for the critical probability of the frog model on homogeneous trees
• Asymptotic shape for the contact process in random environment
• Information Dissemination via Random Walks in d-Dimensional Space
• Cover time for the frog model on trees
• Deviation bounds for the first passage time in the frog model
• Phase transition for the frog model on biregular trees
• The speed of frogs with drift on $\mathbb{Z}$
• Linear and superlinear spread for continuous-time frog model
• Local survival of spread of infection among biased random walks