arXiv Analytics

Sign in

arXiv:math/0107140 [math.PR]AbstractReferencesReviewsResources

Geometry of the Uniform Spanning Forest: Transitions in Dimensions 4, 8, 12

Itai Benjamini, Harry Kesten, Yuval Peres, Oded Schramm

Published 2001-07-19, updated 2003-02-13Version 3

The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the USF in Z^d are adjacent a.s. if 5 <= d <= 8, but not if d >= 9. More generally, let N(x,y) be the minimum number of edges outside the USF in a path joining x and y in Z^d. Then a.s. max{N(x,y) : x,y in Z^d} is the integer part of (d-1)/4. The notion of stochastic dimension for random relations in the lattice is introduced and used in the proof.

Comments: Current version: added some comments regarding related problems and implications, and made some corrections
Journal: Annals Math.160:465-491,2004
DOI: 10.4007/=
Categories: math.PR, math-ph, math.MP
Subjects: 60K35, 60J15
Related articles: Most relevant | Search more
arXiv:1702.05780 [math.PR] (Published 2017-02-19)
The Component Graph of the Uniform Spanning Forest: Transitions in Dimensions $9,10,11,\ldots$
arXiv:1312.0059 [math.PR] (Published 2013-11-30)
Uniform Spanning Forests and the bi-Laplacian Gaussian field
arXiv:1512.09107 [math.PR] (Published 2015-12-30)
Critical Percolation and the Minimal Spanning Tree in Slabs