Popov, Serguei Yu. - Frogs and some other interacting random walks models

dmtcs:3328 - Discrete Mathematics & Theoretical Computer Science, January 1, 2003, DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Frogs and some other interacting random walks models

Authors: Popov, Serguei Yu.

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.


Volume: DMTCS Proceedings vol. AC, Discrete Random Walks (DRW'03)
Section: Proceedings
Published on: January 1, 2003
Submitted on: May 10, 2017
Keywords: simple random walk,critical probability,shape theorem,recurrence,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]


Share

Consultation statistics

This page has been seen 384 times.
This article's PDF has been downloaded 137 times.