Recurrence of planar graph limits

Ori Gurel-Gurevich, Asaf Nachmias

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that any distributional limit of finite planar graphs in which the degree of the root has an exponential tail is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation and quadrangulation (UIPT and UIPQ) are almost surely recurrent, resolving a conjecture of Angel, Benjamini and Schramm. We also settle another related problem of Benjamini and Schramm. We show that in any bounded degree, finite planar graph the probability that the simple random walk started at a uniform random vertex avoids its initial location for T steps is at most C/log T.

Original languageEnglish
Pages (from-to)761-781
Number of pages21
JournalAnnals of Mathematics
Volume177
Issue number2
DOIs
StatePublished - Mar 2013
Externally publishedYes

Fingerprint

Dive into the research topics of 'Recurrence of planar graph limits'. Together they form a unique fingerprint.

Cite this