The components of the Wired Spanning Forest are recurrent

111 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Determinantal processes and completeness of random exponentials: the critical case (2012, background): “For a detailed explanation of the connection between Morris’ theorem and the completeness problem, we refer the reader to [Ly03], in particular Section 7 and the discussion preceding Theorem 7.2 therein.”
Ends in Uniform Spanning Forests (2007, methodology): “The following lemma is obtained from Theorem 6 of Morris (2003) by taking a limit along an exhaustion.”
Determinantal probability measures (2002, background): “Establishing a conjecture of [BLPS01], Morris (2001) proved that on any network (G, w) (where G is the underlying graph and w is the function assigning conductances, or weights, to the edges), for WSF(G, w)-a.”
Probability on Trees and Networks (2017, background): “For general background on Brownian motion, see Mörters and Peres (2010). Other nice references on potential theory are Bass (1995), Port and Stone (1978), and Sznitman (1998).”