BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Recurrence of planar graph limits - Gurel Gurevich
\, O (Hebrew University of Jerusalem)
DTSTART;TZID=Europe/London:20150422T153000
DTEND;TZID=Europe/London:20150422T163000
UID:TALK59140AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/59140
DESCRIPTION:Co-author: Asaf Nacmias (Tel Aviv University) \n\n
What does a random planar triangulation on n verti
ces looks like? More precisely\, what does the loc
al neighbourhood of a fixed vertex in such a trian
gulation 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 wit
h Asaf Nachmias\, we prove this conjecture. The pr
oof uses the electrical network theory of random w
alks and the celebrated Koebe-Andreev-Thurston cir
cle packing theorem. We will give an outline of th
e proof and explain the connection between the cir
cle packing of a graph and the behaviour of a rand
om walk on that graph.\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:
END:VEVENT
END:VCALENDAR