Ergodic theory on stationary random graphs

Itai Benjamini, Nicolas Curien

Research output: Contribution to journalArticlepeer-review


A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random graphs of subexponential growth are almost surely Liouville, that is, admit no non constant bounded harmonic functions. Applications include the uniform infinite planar quadrangulation and long-range percolation clusters.
Original languageEnglish
Pages (from-to)1-20
Number of pages20
JournalElectronic Journal of Probability
StatePublished - Oct 2012


Dive into the research topics of 'Ergodic theory on stationary random graphs'. Together they form a unique fingerprint.

Cite this