OxTalks will soon move to the new Halo platform and will become 'Oxford Events.' There will be a need for an OxTalks freeze. This was previously planned for Friday 14th November – a new date will be shared as soon as it is available (full details will be available on the Staff Gateway).
In the meantime, the OxTalks site will remain active and events will continue to be published.
If staff have any questions about the Oxford Events launch, please contact halo@digital.ox.ac.uk
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.
