skip to content
 

Recurrence of planar graph limits

Presented by: 
O Gurel Gurevich Hebrew University of Jerusalem
Date: 
Wednesday 22nd April 2015 - 15:30 to 16:30
Venue: 
INI Seminar Room 1
Abstract: 
Co-author: Asaf Nacmias (Tel Aviv University)

What does a random planar triangulation on n vertices looks like? More precisely, what does the local neighbourhood of a fixed vertex in such a triangulation looks like? When n goes to infinity, the resulting object is a random rooted graph called the Uniform Infinite Planar Triangulation (UIPT). Angel, Benjamini and Schramm conjectured that the UIPT and similar objects are recurrent, that is, a simple random walk on the UIPT returns to its starting vertex almost surely. In a joint work with Asaf Nachmias, we prove this conjecture. The proof uses the electrical network theory of random walks and the celebrated Koebe-Andreev-Thurston circle packing theorem. We will give an outline of the proof and explain the connection between the circle packing of a graph and the behaviour of a random walk on that graph.

University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons