The shape theorem for the frog model with random initial configuration

Simple item page
dc.creatorAlves, O. S. M.
dc.creatorMachado, F. P.
dc.creatorPopov, S. Yu.
dc.creatorRavishankar, K.
dc.date2001-10-25
dc.date.accessioned2026-07-07T04:44:05Z
dc.date.available2026-07-07T04:44:05Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0110280
dc.identifierhttp://arxiv.org/abs/math/0110280
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/62493
dc.subjectProbability
dc.subject60K35; 60J10
dc.titleThe shape theorem for the frog model with random initial configuration
dc.typetext

Files

Collections

arXiv