Frogs and some other interacting random walks modelsArticle
Authors: Serguei Yu. Popov 1
NULL
Serguei Yu. Popov
1 Instituto de Matemática e Estatística
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.
Martin P.W. Zerner, 2018, Recurrence and transience of contractive autoregressive processes and related Markov chains, Electronic journal of probability, 23, none, 10.1214/18-ejp152, https://doi.org/10.1214/18-ejp152.
Irina Kurkova;Serguei Yu Popov;Marina Vachkovskaia, 2004, On Infection Spreading and Competition between Independent Random Walks, Electronic Journal of Probability, 9, none, 10.1214/ejp.v9-197, https://doi.org/10.1214/ejp.v9-197.