BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Scaling limit of high-dimensional random spanning trees - Eleanor 
 Archer (Paris)
DTSTART:20240528T131400Z
DTEND:20240528T141500Z
UID:TALK217291@talks.cam.ac.uk
CONTACT:Perla Sousi
DESCRIPTION:A spanning tree of a finite connected graph G is a connected\n
 subgraph of G that includes every vertex and contains no cycles. In this\n
 talk we will consider uniformly drawn spanning trees of high-dimensional\n
 graphs\, and explain why\, under appropriate rescaling\, they converge in\
 ndistribution as metric-measure spaces to Aldous’ Brownian CRT. Our\nres
 ult extends an earlier result of Peres and Revelle (2004) who\npreviously 
 showed a form of finite-dimensional convergence. If time\npermits\, we may
  also discuss scaling limits of random spanning trees\nwith non-uniform la
 ws. Based on joint works with Asaf Nachmias and Matan Shalev.
LOCATION:MR12
END:VEVENT
END:VCALENDAR