14th Northwest Probability Seminar – Recurrence of planar graph limits.
- Asaf Nachmias | University of British Columbia
- Northwest Probability Seminar 2012
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.
Joint work with Ori Gurel-Gurevich.
-
-
Asaf Nachmias
-
David Wilson
Principal Researcher
-
-
Watch Next
-
-
-
Accelerating MRI image reconstruction with Tyger
- Karen Easterbrook,
- Ilyana Rosenberg
-
-
-
-
-
-
-
Using Optimization and LLMs to Enhance Cloud Supply Chain Operations
- Beibin Li,
- Konstantina Mellou,
- Ishai Menache