DMTCS Proceedings, Discrete Random Walks, DRW'03

Font Size:  Small  Medium  Large

Frogs and some other interacting random walks models

Serguei Yu. Popov


We review some recent results for a system of simple random walks on graphs, known as frog 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.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional