Geometry of the uniform spanning forest: Transitions in dimensions 4, 8, 12 ,...

@article{Benjamini2001GeometryOT,
  title={Geometry of the uniform spanning forest: Transitions in dimensions 4, 8, 12 ,...},
  author={Itai Benjamini and Harry Kesten and Yuval Peres and Oded Schramm},
  journal={Annals of Mathematics},
  year={2001},
  volume={160},
  pages={465-491}
}
The uniform spanning forest (USF) in ℤ d is the weak limit of random, uniformly chosen, spanning trees in [−n, n] d . Pemantle [11] 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 ℤ 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 ℤ d . Then $$\max \{ N(x,y):x,y{ \in \mathbb{Z}^d}\} = \left\lfloor {(d - 1)/4} \right… 

Figures from this paper

Percolation beyond ℤd: the contributions of Oded Schramm*
Oded Schramm (1961–2008) influenced greatly the development of percolation theory beyond the usual ℤ d setting, in particular the case of nonamenable lattices. Here we review some of his work in this
Behavior of the distance exponent for $\frac{1}{|x-y|^{2d}}$ long-range percolation
We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $u$ and $v$ are connected with probability 1 for $\|u-v\|_\infty=1$ and with probability $1-e^{-\beta
Distances in $\frac{1}{|x-y|^{2d}}$ percolation models for all dimensions
We study independent long-range percolation on Z for all dimensions d, where the vertices u and v are connected with probability 1 for ‖u − v‖∞ = 1 and with probability p(β, {u, v}) = 1 − e −β ∫
Small worlds and clustering in spatial networks
TLDR
This work identifies the general subclass of spatial homogeneous and heterogeneous network models that are sparse small worlds and that have nonzero clustering in the thermodynamic limit and relies on the maximum entropy approach.
Sharp asymptotic for the chemical distance in long‐range percolation
TLDR
The proof of the asymptotic scaling is based on a subadditive argument along a continuum of doubly-exponential sequences of scales and strengthens considerably the conclusions obtained earlier by the first author.
Topics in loop measures and the loop-erased walk
These are notes based on a course that I gave at the University of Chicago in Fall 2016 on "Loop measures and the loop-erased random walk." This is not intended to be a comprehensive view but rather
Random Graphs and Complex Networks
  • R. Hofstad
  • Computer Science
    Cambridge Series in Statistical and Probabilistic Mathematics
  • 2016
TLDR
This chapter explains why many real-world networks are small worlds and have large fluctuations in their degrees, and why Probability theory offers a highly effective way to deal with the complexity of networks, and leads us to consider random graphs.
From random walk trajectories to random interlacements
We review and comment recent research on random interlacements model introduced by A.-S. Sznitman in [43]. A particular emphasis is put on motivating the definition of the model via natural questions
Efficient routeing in Poisson small-world networks
TLDR
This work extends the result to more realistic models constructed from a Poisson point process wherein each point is connected to all its neighbours within some fixed radius, and possesses random shortcuts to more distant nodes as described above.
Efficient routing in Poisson small-world networks
  • M.Á.
  • Computer Science
  • 2006
TLDR
This work extends the result to more realistic models constructed from a Poisson point process, wherein each point is connected to all its neighbours within some fixed radius, as well as possessing random shortcuts to more distant nodes as described above.

References

SHOWING 1-10 OF 23 REFERENCES
Choosing a Spanning Tree for the Integer Lattice Uniformly
Consider the nearest neighbor graph for the integer lattice Zd in d dimensions. For a large finite piece of it, consider choosing a spanning tree for that piece uniformly among all possible subgraphs
Generating random spanning trees more quickly than the cover time
TLDR
This paper gives a new algorithm for generating random spanning trees of an undirected graph that is easy to code up, has small running time constants, and has a nice proof that it generates trees with the right probabilities.
STEIN, Spin-glass model with dimension-dependent ground state
  • Phys. Rev. Lett
  • 1994
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)
Principles Of Random Walk
This book is devoted exclusively to a very special class of random processes, namely to random walk on the lattice points of ordinary Euclidean space. The author considered this high degree of
Some Random Series of Functions
1. A few tools from probability theory 2. Random series in a Banach space 3. Random series in a Hilbert space 4. Random Taylor series 5. Random Fourier series 6. A bound for random trigonometric
Principles of random walks
  • Graduate Texts in Mathematics
  • 1976
Random walks and Riesz kernels.
...
...