University of Cambridge > > Probability > Recurrence of planar graph limits

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.


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