University of Cambridge > > Probability > Scaling limit of high-dimensional random spanning trees

Scaling limit of high-dimensional random spanning trees

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

  • UserEleanor Archer (Paris) World_link
  • ClockTuesday 28 May 2024, 14:14-15:15
  • HouseMR12.

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

A spanning tree of a finite connected graph G is a connected subgraph of G that includes every vertex and contains no cycles. In this talk we will consider uniformly drawn spanning trees of high-dimensional graphs, and explain why, under appropriate rescaling, they converge in distribution as metric-measure spaces to Aldous’ Brownian CRT . Our result extends an earlier result of Peres and Revelle (2004) who previously showed a form of finite-dimensional convergence. If time permits, we may also discuss scaling limits of random spanning trees with non-uniform laws. Based on joint works with Asaf Nachmias and Matan Shalev.

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