Skip to main content

Advertisement

SpringerLink
  • Log in
  1. Home
  2. Probability Theory and Related Fields
  3. Article
The components of the Wired Spanning Forest are recurrent
Download PDF
Your article has downloaded

Similar articles being viewed by others

Slider with three articles shown per slide. Use the Previous and Next buttons to navigate the slides or the slide controller buttons at the end to navigate through each slide.

Universality of high-dimensional spanning forests and sandpiles

05 June 2019

Tom Hutchcroft

The local limit of uniform spanning trees

22 June 2021

Asaf Nachmias & Yuval Peres

The component graph of the uniform spanning forest: transitions in dimensions $$9,10,11,\ldots $$ 9 , 10 , 11 , …

23 November 2018

Tom Hutchcroft & Yuval Peres

Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture

17 May 2018

Julien Bensmail, Ararat Harutyunyan, … Stéphan Thomassé

Range and Speed of Rotor Walks on Trees

20 April 2019

Wilfried Huss & Ecaterina Sava-Huss

On alternating paths and the smallest positive eigenvalue of trees

12 December 2019

Sonu Rani & Sasmita Barik

On the transience and recurrence of Lamperti's random walk on Galton-Watson trees

15 April 2019

Wenming Hong & Minzhi Liu

On the Number of Forests and Connected Spanning Subgraphs

30 July 2021

Márton Borbényi, Péter Csikvári & Haoran Luo

On planar graphs of uniform polynomial growth

27 May 2021

Farzam Ebrahimnejad & James R. Lee

Download PDF
  • Published: February 2003

The components of the Wired Spanning Forest are recurrent

  • Ben Morris1 

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

  • 11k Accesses

  • 34 Citations

  • 346 Altmetric

  • Metrics details

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.

Download to read the full article text

Working on a manuscript?

Avoid the common mistakes

Author information

Authors and 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

  • Issue Date: February 2003

  • DOI: https://doi.org/10.1007/s00440-002-0236-0

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

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

Working on a manuscript?

Avoid the common mistakes

Advertisement

Over 10 million scientific documents at your fingertips

Switch Edition
  • Academic Edition
  • Corporate Edition
  • Home
  • Impressum
  • Legal information
  • Privacy statement
  • California Privacy Statement
  • How we use cookies
  • Manage cookies/Do not sell my data
  • Accessibility
  • FAQ
  • Contact us
  • Affiliate program

Not logged in - 44.201.94.236

Not affiliated

Springer Nature

© 2023 Springer Nature Switzerland AG. Part of Springer Nature.