Abstract: I will explain a recent result with Tom Hutchcroft, in which we prove that if a stationary random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. I will also explain some of the older results for the transient case (if we have the time) and highlight the difference between the two cases. Together, these results prove a conjecture by Aldous and Lyons (2006).
One-endedness of the uniform spanning tree on stationary graphs
10.11.2022 14:00 - 16:00
Organiser:
M. Lis (TU Wien)
Location:
TU Wien, Seminarraum 389, EG, Gußhausstraße 25-29, 1040 Wien