Frogs and some other interacting random walks models - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

Frogs and some other interacting random walks models


We review some recent results for a system of simple random walks on graphs, known as \emphfrog model. Also, we discuss several modifications of this model, and present a few open problems. A simple version of the frog model can be described as follows: There are active and sleeping particles living on some graph. Each active particle performs a simple random walk with discrete time and at each moment it may disappear with probability 1-p. When an active particle hits a sleeping particle, the latter becomes active.
Fichier principal
Vignette du fichier
dmAC0126.pdf (169.14 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01183923 , version 1 (12-08-2015)



Serguei Yu. Popov. Frogs and some other interacting random walks models. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.277-288, ⟨10.46298/dmtcs.3328⟩. ⟨hal-01183923⟩


56 View
762 Download



Gmail Facebook Twitter LinkedIn More