COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The uniform spanning forest of planar graphs

## The uniform spanning forest of planar graphsAdd to your list(s) Download to your calendar using vCal - Nachmias, A (Tel Aviv University)
- Thursday 23 April 2015, 09:00-10:00
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact webseminars. Random Geometry The free uniform spanning forest (FUSF) of an infinite graph G is obtained as the weak limit of the law of a uniform spanning tree on G_n, where G_n is a finite exhaustion of G. It is easy to see that the FUSF is supported on spanning graphs of G with no cycles, but it need not be connected. Indeed, a classical result of Pemantle (‘91) asserts that when G=Z^d, the FUSF is almost surely a connected tree if and only if d=1,2,3,4. In this talk we will show that if G is a plane graph with bounded degrees, then the FUSF is almost surely connected, answering a question of Benjamini, Lyons, Peres and Schramm (‘01). An essential part of the proof is the circle packing theorem. Joint work with Tom Hutchcroft. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other lists1 and 1/2 APDE days Group Theory, Geometry and Representation Theory: Abel Prize 2008 The Cambridge University Energy Network (CUEN)## Other talksOpen IP in Emerging and Developing Economies The microenvironment in the myeloid malignancies Designer Babies or Children of Frankenstein? Genome Editing and its Side Effects Surface meltwater ponding and drainage causes ice-shelf flexure Making Smart Decisions in Systems Design: How to Engineer Decisions in a Connected World? Trees as keys, ladders, maps: a revisionist history of early systematic trees |