Scaling limit of high-dimensional uniform spanning trees
A spanning tree of a finite connected graph G is a connected subgraph of G that touches every vertex and contains no cycles. In this talk we will consider uniformly drawn spanning trees of ``high-dimensional’‘ graphs, and show that, under appropriate rescaling, they converge in distribution as metric-measure spaces to Aldous’ Brownian CRT. This extends an earlier result of Peres and Revelle (2004) who previously showed a form of finite-dimensional convergence. Based on joint works with Asaf Nachmias and Matan Shalev.
Date: 7 November 2022, 12:00 (Monday, 5th week, Michaelmas 2022)
Venue: Mathematical Institute, Woodstock Road OX2 6GG
Venue Details: L5
Speaker: Eleanor Archer (Paris Nanterre)
Organising department: Department of Statistics
Part of: Probability seminar
Booking required?: Not required
Audience: Public
Editor: Christina Goldschmidt