Recurrence of planar graph limits

From MaRDI portal
Publication:1947644

DOI10.4007/ANNALS.2013.177.2.10zbMATH Open1262.05031arXiv1206.0707OpenAlexW2963558300MaRDI QIDQ1947644FDOQ1947644

Asaf Nachmias, Ori Gurel-Gurevich

Publication date: 23 April 2013

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1206.0707





Cites Work


Cited In (54)

Uses Software






This page was built for publication: Recurrence of planar graph limits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947644)