paper

Recurrence and transience for the frog model on trees

arXiv:1404.6238 · doi:10.1214/16-AOP1125

Abstract

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite -ary tree. We prove the model undergoes a phase transition, finding it recurrent for and transient for . Simulations suggest strong recurrence for , weak recurrence for , and transience for . Additionally, we prove a 0-1 law for all -ary trees, and we exhibit a graph on which a 0-1 law does not hold. To prove recurrence when , we construct a recursive distributional equation for the number of visits to the root in a smaller process and show the unique solution must be infinity a.s. The proof of transience when relies on computer calculations for the transition probabilities of a large Markov chain. We also include the proof for , which uses similar techniques but does not require computer assistance.

24 pages, 8 figures to appear in Annals of Probability

References in corpus (5)

Cited by in corpus (16)