Open Access
Translator Disclaimer
March 2018 Interlacements and the wired uniform spanning forest
Tom Hutchcroft
Ann. Probab. 46(2): 1170-1200 (March 2018). DOI: 10.1214/17-AOP1203


We extend the Aldous–Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infinite, transient graphs. We do this by replacing the simple random walk in the classical algorithm with Sznitman’s random interlacement process. We then apply this algorithm to study the WUSF, showing that every component of the WUSF is one-ended almost surely in any graph satisfying a certain weak anchored isoperimetric condition, that the number of ‘excessive ends’ in the WUSF is nonrandom in any graph, and also that every component of the WUSF is one-ended almost surely in any transient unimodular random rooted graph. The first two of these results answer positively two questions of Lyons, Morris and Schramm [Electron. J. Probab. 13 (2008) 1702–1725], while the third extends a recent result of the author.

Finally, we construct a counterexample showing that almost sure one-endedness of WUSF components is not preserved by rough isometries of the underlying graph, answering negatively a further question of Lyons, Morris and Schramm.


Download Citation

Tom Hutchcroft. "Interlacements and the wired uniform spanning forest." Ann. Probab. 46 (2) 1170 - 1200, March 2018.


Received: 1 December 2015; Revised: 1 May 2017; Published: March 2018
First available in Project Euclid: 9 March 2018

zbMATH: 06864082
MathSciNet: MR3773383
Digital Object Identifier: 10.1214/17-AOP1203

Primary: 60D05

Keywords: coarse geometry , Random interlacements , Spanning forests , unimodular random graphs

Rights: Copyright © 2018 Institute of Mathematical Statistics


Vol.46 • No. 2 • March 2018
Back to Top