Pith. sign in

REVIEW 1 cited by

Recurrence of planar graph limits

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1206.0707 v1 pith:V4KFG5X7 submitted 2012-06-04 math.PR math.CO

Ori Gurel-Gurevich , Asaf Nachmias This is my paper · ORCID
classification math.PRmath.CO
keywords planaralmostbenjaminidegreefinitegraphrandomrecurrent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Random punctured hyperbolic surfaces & the Brownian sphere

    math.PR 2025-08 conditional novelty 8.0 of 10

    Random Weil-Petersson punctured spheres converge, after fourth-root rescaling, to the Brownian sphere.

Pith tools