Abstract
We show that a.s. all of the connected components of the Wired Spanning Forest are recurrent, proving a conjecture of Benjamini, Lyons, Peres and Schramm. Our analysis relies on a simple martingale involving the effective conductance between the endpoints of an edge in a uniform spanning tree. We believe that this martingale is of independent interest and will find further applications in the study of uniform spanning trees and forests.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 20 April 2001 / Revised version: 23 July 2002 / Published online: 14 November
Rights and permissions
About this article
Cite this article
Morris, B. The components of the Wired Spanning Forest are recurrent. Probab Theory Relat Fields 125, 259–265 (2003). https://doi.org/10.1007/s00440-002-0236-0
Issue Date:
DOI: https://doi.org/10.1007/s00440-002-0236-0