30.05.2023 16:30 Eleanor Archer (Université Paris Nanterre):
Scaling limit of high-dimensional uniform spanning trees2.01.10 (Parkring 11, 85748 Garching-Hochbrück)

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.