On transience of frogs on galton–watson trees

Sebastian Müller*, Gundelinde Maria Wiegel

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We consider an interacting particle system, known as the frog model, on infinite Galton–Watson trees allowing offspring 0 and 1. The system starts with one awake particle (frog) at the root of the tree and a random number of sleeping particles at the other vertices. Awake frogs move according to simple random walk on the tree and as soon as they encounter sleeping frogs, those will wake up and move independently according to simple random walk. The frog model is called transient if there are almost surely only finitely many particles returning to the root. In this paper we prove a 0–1-law for transience of the frog model and show the existence of a transient phase for certain classes of Galton–Watson trees.

Original languageEnglish
Article number152
Pages (from-to)1-30
Number of pages30
JournalElectronic Journal of Probability
Publication statusPublished - 1 Jan 2020


  • Branching Markov chain
  • Frog model
  • Recurrence and transience

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty


Dive into the research topics of 'On transience of frogs on galton–watson trees'. Together they form a unique fingerprint.

Cite this