The components of the Wired Spanning Forest are recurrent

Probability Theory and Related Fields volume 125, pages259–265(2003)Cite this article

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.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Statistics Department, University of California, Berkeley CA 94720, USA. Supported by an NSF Postdoctoral Fellowship. e-mail: morris@stat.berkeley.edu, US

    Ben Morris

Authors
  1. Ben Morris
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 20 April 2001 / Revised version: 23 July 2002 / Published online: 14 November

Rights and permissions

Reprints 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

Download citation

Keywords

  • Endpoint
  • Peris
  • Span Tree
  • Independent Interest
  • Effective Conductance