Open Access
2008 Ends in Uniform Spanning Forests
Russell Lyons, Benjamin Morris, Oded Schramm
Author Affiliations +
Electron. J. Probab. 13: 1702-1725 (2008). DOI: 10.1214/EJP.v13-566


It has hitherto been known that in a transitive unimodular graph, each tree in the wired spanning forest has only one end a.s. We dispense with the assumptions of transitivity and unimodularity, replacing them with a much broader condition on the isoperimetric profile that requires just slightly more than uniform transience.


Download Citation

Russell Lyons. Benjamin Morris. Oded Schramm. "Ends in Uniform Spanning Forests." Electron. J. Probab. 13 1702 - 1725, 2008.


Accepted: 21 September 2008; Published: 2008
First available in Project Euclid: 1 June 2016

zbMATH: 1191.60016
MathSciNet: MR2448128
Digital Object Identifier: 10.1214/EJP.v13-566

Primary: 60B99
Secondary: 20F32 , 60D05

Keywords: Cayley graphs , Spanning trees

Vol.13 • 2008
Back to Top