Phase transition for the frog model
概率论
2019-03-05 v2
摘要
We study a system of simple random walks on graphs, known as frog model. This model can be described as follows: There are active and sleeping particles living on some graph G. 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. Phase transition results and asymptotic values for critical parameters are presented for Z^d and regular trees.
引用
@article{arxiv.math/0104044,
title = {Phase transition for the frog model},
author = {O. S. M. Alves and F. P. Machado and S. Yu. Popov},
journal= {arXiv preprint arXiv:math/0104044},
year = {2019}
}