A zero-one law for recurrence and transience of frog processes
arXiv:1508.01953
Abstract
We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog dynamics are given by quasi-transitive Markov chains or by random walks in a common random environment including super-critical percolation clusters on . We also give a sufficient and almost sharp condition for recurrence of uniformly elliptic frog processes on . Its proof uses the general zero-one law.
arXiv comment30 pages; revised version
References in corpus (8)
- Recent progress on the Random Conductance Model
- Phase transition for the frog model
- From transience to recurrence with Poisson tree frogs
- A new upper bound for the critical probability of the frog model on homogeneous trees
- Random Dirichlet environment viewed from the particle in dimension
- Shortest spanning trees and a counterexample for random walks in random environments
- On the range of the transient frog model on Z
- The speed of frogs with drift on