From transience to recurrence with Poisson tree frogs
arXiv:1501.05874 · doi:10.1214/15-AAP1127
Abstract
Consider the following interacting particle system on the -ary tree, known as the frog model: Initially, one particle is awake at the root and i.i.d. Poisson many particles are sleeping at every other vertex. Particles that are awake perform simple random walks, awakening any sleeping particles they encounter. We prove that there is a phase transition between transience and recurrence as the initial density of particles increases, and we give the order of the transition up to a logarithmic factor.
Published at http://dx.doi.org/10.1214/15-AAP1127 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (3)
Cited by in corpus (20)
- Stochastic orders and the frog model
- Recurrence and Transience of Frogs with Drift on
- The critical density for the frog model is the degree of the tree
- Infection spread for the frog model on trees
- Frogs on trees?
- Cover time for the frog model on trees
- Sensitivity of the frog model to initial conditions
- On the range of the transient frog model on Z
- Laws of large numbers for the frog model on the complete graph
- Phase transition for the frog model on biregular trees
- Deviation bounds for the first passage time in the frog model
- The frog model with drift on R
- The continuous-time frog model can spread arbitrarily fast
- The speed of frogs with drift on
- A zero-one law for recurrence and transience of frog processes
- Linear and superlinear spread for continuous-time frog model
- The frog model on Galton-Watson trees
- A stochastic combustion model with thresholds on trees
- On the minimal drift for recurrence in the frog model on -ary trees
- Passage time of the frog model has a sublinear variance