University of Cambridge > Talks.cam > Probability > Recurrence of planar graph limits

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Recurrence of planar graph limits

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact neb25.

We will show that any distributional limit of finite planar graphs in which the degree of the root decays exponentially is almost surely recurrent. As a corollary, we obtain that the uniform infinite planar triangulation/quadrangulation (UIPT/UIPQ) are almost surely recurrent, resolving conjectures of Angel, Benjamini and Schramm. Joint work with Asaf Nachmias.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Early Detection breakfast meetings CU Caving Club talks

Other talks

Disease Migration CANCELLED DUE TO STRIKE ACTION Recent advances in understanding climate, glacier and river dynamics in high mountain Asia Intelligent Self-Driving Vehicles Power to the People – Creating Markets for Supply Security Based on Consumer Choice Symbolic AI in Computational Biology; applications to disease gene and drug target identification Diagnostics and patient pathways in pancreatic cancer Katie Field - Symbiotic options for the conquest of land Knot Floer homology and algebraic methods The ‘Easy’ and ‘Hard’ Problems of Consciousness Crowding and the disruptive effect of clutter throughout the visual system Protein Folding, Evolution and Interactions Symposium Multilingual Identities and Heterogeneous Language Ideologies in the New Latino Diaspora
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity