The components of the wired spanning forest are recurrent

Probability Theory and Related Fields

Volumn 125, Issue 2, 2003, Pages 259-265

  Morris, Ben ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038609542     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-002-0236-0     Document Type: Article

References (8)

1. [BLPS] Benjamin, I., Lyons, R., Peres, Y., Schramm, O.: Uniform spanning forests. Annals of Probability 29, 1-65 (2001)
2. [DS] Doyle, P., Snell, J.:. Random Walks and Electric Networks, Mathematical Assoc. of America, Washington, DC 1994
3. [H] Häggström, O.: Random-cluster measures and uniform spanning trees, Stock. Proc. Appl. 59, 267-275 (1995)
4. [K] Kirchhoff, G.: Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird, Ann. Phys. und Chem. 72(12), 497-508 (1847)
5. [L] Lyons, R.: A bird's-eye view of uniform spanning trees and forests. In Microsurveys in Discrete Probability, Amer. Math. Soc., Providence, RI, 135-162 (1998)
6. [LP] Lyons, R., Peres, Y.: Probability on Trees and Networks. Cambridge University Press, in preparation. Current version available at http://php.indiana.edu/rdlyons/
7. [P] Pemantle, R.: Choosing a spanning tree for the integer lattice uniformly. Annals of Probability 19, 1559-1574 (1991)
8. [S] Soardi, P.: Potential Theory on Infinite Networks, Springer, Berlin, 1994