The number of ends in the uniform spanning tree for recurrent unimodular random graphs
From MaRDI portal
Publication:6423010
arXiv2301.03875MaRDI QIDQ6423010FDOQ6423010
Authors: Diederik van Engelenburg, Tom Hutchcroft 
Publication date: 10 January 2023
Abstract: We prove that if a unimodular 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. Together with previous results in the transient case, this completely resolves the problem of the number of ends of wired uniform spanning forest components in unimodular random rooted graphs and confirms a conjecture of Aldous and Lyons (2006).
This page was built for publication: The number of ends in the uniform spanning tree for recurrent unimodular random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423010)
