Uniform spanning forests

We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF) boundary conditions. Pemantle proved that the free and wired spanning forests coincide in Z d and that they give a single tree iff d ≤ 4. In the present work, we extend Pemantle's alternative to general graphs and exhibit further connections of uniform spanning forests to random walks, potential theory, invariant percolation and amenability. The uniform spanning forest model is related to random cluster models in statistical physics, but, because of the preceding connections, its analysis can be carried further. Among our results are the following: ○ The FSF and WSF in a graph G coincide iff all harmonic Dirichlet functions on G are constant. ○ The tail σ-fields of the WSF and the FSF are trivial on any graph. ○ On any Cayley graph that is not a finite extension of Z, all component trees of the WSF have one end; this is new in Z d for d > 5. . On any tree, as well as on any graph with spectral radius less than 1, a.s. all components of the WSF are recurrent. ○ The basic topology of the free and the wired uniform spanning forest measures on lattices in hyperbolic space H d is analyzed. . A Cayley graph is amenable iff for all e > 0, the union of the WSF and Bernoulli percolation with parameter e is connected. ○ Harmonic measure from infinity is shown to exist on any recurrent proper planar graph with finite codegrees. We also present numerous open problems and conjectures.

[1]  Russell Lyons,et al.  Percolation Perturbations in Potential Theory and Random Walks , 1998, math/9804010.

[2]  Harry Kesten,et al.  Symmetric random walks on groups , 1959 .

[3]  Olle Häggström,et al.  Random-cluster measures and uniform spanning trees , 1995 .

[4]  Loop-erased self-avoiding random walk in two and three dimensions , 1988 .

[5]  Rita Solomyak.  Essential Spanning Forests and Electrical Networks on Groups , 1999 .

[6]  M. Kanai.  Rough isometries and the parabolicity of riemannian manifolds , 1986 .

[7]  D. A. Edwards.  On the existence of probability measures with given marginals , 1978 .

[8]  Hans-Otto Georgii,et al.  Gibbs Measures and Phase Transitions , 1988 .

[9]  H. Kesten,et al.  Inequalities with applications to percolation and reliability , 1985 .

[10]  I. Benjamini,et al.  Percolation Beyond $Z^d$, Many Questions And a Few Answers , 1996 .

[11]  Tomás Feder,et al.  Balanced matroids , 1992, STOC '92.

[12]  Yvan Saint-Aubin,et al.  Conformal invariance in two-dimensional percolation , 1994 .

[13]  Critical Random Walk in Random Environment on Trees , 1995 .

[14]  David Bruce Wilson,et al.  Generating random spanning trees more quickly than the cover time , 1996, STOC '96.

[15]  A. Valette,et al.  Group Cohomology, Harmonic Functions and the First L2 -Betti Number , 1997 .

[16]  P. Doyle,et al.  Electric currents in innite networks , 1988 .

[17]  David Bruce Wilson,et al.  Scaling limits for minimal and random spanning trees in two dimensions , 1999, Random Struct. Algorithms.

[18]  Russell Lyons,et al.  Random Walks, Capacity and Percolation on Trees , 1992 .

[19]  G. Kirchhoff.  Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird , 1847 .

[20]  Bojan Mohar,et al.  Some relations between analytic and geometric properties of infinite graphs , 1991, Discret. Math..

[21]  Scaling limits for minimal and random spanning trees in two dimensions , 1998, math/9809145.

[22]  Itai Benjamini,et al.  Conformal Invariance of Voronoi Percolation , 1998 .

[23]  Paolo M. Soardi,et al.  Potential Theory on Infinite Networks , 1994 .

[24]  Andrei Z. Broder,et al.  Generating random spanning trees , 1989, 30th Annual Symposium on Foundations of Computer Science.

[25]  I. Benjamini,et al.  Harmonic functions on planar and almost planar graphs and manifolds, via circle packings , 1996 .

[26]  Harry Kesten,et al.  Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12 , 2001 .

[27]  C. Itzykson,et al.  Conformal Invariance , 1987 .

[28]  Russell Lyons,et al.  Group-invariant Percolation on Graphs , 1999 .

[29]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[30]  Olle Häggström,et al.  Infinite clusters in dependent automorphism invariant percolation on trees , 1997 .

[31]  Extension of Foster’s averaging formula to infinite networks with moderate growth , 1995 .

[32]  R. Pemantle.  Towards a theory of negative dependence , 2000, math/0404095.

[33]  R. Lyons.  Random Walks and Percolation on Trees , 1990 .

[34]  H. Kesten.  Subdiffusive behavior of random walk on a random cluster , 1986 .

[35]  N. Varopoulos.  Isoperimetric inequalities and Markov chains , 1985 .

[36]  M. Nakai,et al.  Classification Theory of Riemannian Manifolds , 1977 .

[37]  I. Holopainen,et al.  p-harmonic functions on graphs and manifolds , 1997 .

[38]  Richard Kenyon,et al.  Conformal invariance of domino tiling , 1999 .

[39]  Olle Häggström,et al.  Uniform and minimal essential spanning forests on trees , 1998, Random Struct. Algorithms.

[40]  J. Dodziuk.  L^2-harmonic forms on rotationally symmetric Riemannian manifolds , 1979 .

[41]  A Lower Bound on the Growth Exponent for Loop-Erased Random Walk in Two Dimensions , 1998, math/9803034.

[42]  J. Dodziuk.  Difference equations, isoperimetric inequality and transience of certain random walks , 1984 .

[43]  R. Pemantle.  Choosing a Spanning Tree for the Integer Lattice Uniformly , 1991, math/0404043.

[44]  W. T. Tutte,et al.  The Dissection of Rectangles Into Squares , 1940 .

[45]  David Aldous,et al.  The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees , 1990, SIAM J. Discret. Math..

[46]  Kenneth S. Alexander,et al.  Percolation and minimal spanning forests in infinite graphs , 1995 .

[47]  I. Benjamini,et al.  Random walks and harmonic functions on infinite planar graphs using square tilings , 1996 .

[48]  M. Gromov.  Groups of polynomial growth and expanding maps , 1981 .

[49]  Oded Schramm,et al.  Scaling limits of loop-erased random walks and uniform spanning trees , 1999, math/9904022.

[50]  P. Soardi,et al.  Proceedings of the American Mathematical Society Rough Isometries and Dirichlet Finite Harmonic Functions on Graphs , 2022 .

[51]  G. Grimmett.  The Stochastic Random-Cluster Process and the Uniqueness of Random-Cluster Measures , 1995 .

[52]  Laurent Saloff-Coste,et al.  GAUSSIAN ESTIMATES FOR MARKOV CHAINS AND RANDOM WALKS ON GROUPS , 1993 .

[53]  Wendelin Werner,et al.  The true self-repelling motion , 1998 .

[54]  Carsten Thomassen,et al.  Resistances and currents in infinite electrical networks , 1990, J. Comb. Theory, Ser. B.

[55]  David Bruce Wilson,et al.  How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph , 1998, J. Algorithms.

[56]  Indistinguishability of Percolation Clusters , 1998, math/9811170.

[57]  F. Papangelou.  GIBBS MEASURES AND PHASE TRANSITIONS (de Gruyter Studies in Mathematics 9) , 1990 .

[58]  Thomas Chaboud,et al.  Planar Cayley Graphs with Regular Dual , 1996, Int. J. Algebra Comput..

[59]  R. Burton,et al.  Density and uniqueness in percolation , 1989 .

[60]  R. Kenyon.  Long-range properties of spanning trees , 2000 .

[61]  Uniform and minimal essential spanning forests on trees , 1998 .

[62]  Russell Lyons,et al.  A bird's-eye view of uniform spanning trees and forests , 1997, Microsurveys in Discrete Probability.

[63]  Peter Gerl.  Random walks on graphs with a strong isoperimetric property , 1988 .