Scaling limits of random choice spanning trees
1st March 2024, 3:30 pm – 4:30 pm
Fry Building, 2.04
A spanning tree of a finite connected graph G is a connected subgraph of G that contains every vertex and contains no cycles. A well-known result of Aldous states that the scaling limit of a uniformly chosen spanning tree of the complete graph is the Brownian tree (CRT). In this talk, we will consider new ways to sample random spanning trees of the complete graph to obtain different scaling limits. We call these new trees "choice spanning trees". Based on joint works with Asaf Nachmias and Matan Shalev.