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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹ️ Information

Scaling limit of high-dimensional random spanning trees

Download to your calendar using vCal

  • UserEleanor Archer (Paris) Speaker website
  • 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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

GN06, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon https://meet.google.com/anb-obog-oer https://cam-ac-uk.zoom.us/j/84204498431?pwd=Um1oU284b1YxWThObGw4ZU9XZitWdz09

Other talks

Group Presentation 4 Title to be confirmed Group Work TOWARD AFFORDABLE PREVENTIVE HEALTHCARE: How basic science addresses grand challenges Coming soon From Physics-informed Neural Networks to Numerically Verified Proofs in Geometric Analysis
 

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