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

Annals of Mathematics

Volumn 160, Issue 2, 2004, Pages 465-491

  Benjamini, Itai ^a   Kesten, Harry ^b   Peres, Yuval ^c   Schramm, Oded ^d  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Department of Obstetrics Gynecology   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d MICROSOFT   (United States)

Author keywords

Stochastic dimension; Uniform spanning forest

Indexed keywords

EID: 8744265454     PISSN: 0003486X     EISSN: None     Source Type: Journal    
DOI: 10.4007/annals.2004.160.465     Document Type: Article

References (16)

1. d, Proc. London Math. Soc. 64, 125-152.
2. I. BENJAMINI, R. LYONS, Y. PERES, and O. SCHRAMM, Uniform spanning forests, Ann. Probab. 29 (2001), 1-65.
3. M. GROMOV, Groups of polynomial growth and expanding maps, Inst. Hautes Études Sci. Publ. Math. 53 (1981), 53-73.
4. W. HEBISCH and L. SALOFF-COSTE, Gaussian estimates for Markov chains and random walks on groups, Ann. Probab. 21 (1993), 673-709.
5. J.-P. KAHANE, Some Random Series of Functions, Second edition, Cambridge Univ. Press, Cambridge, U.K. (1985).
6. V. A. KAǏMANOVICH and A. M. VERSHIK, Random walks on discrete groups: boundary and entropy, Ann. Probab. 11 (1983), 457-490.
7. G. F. LAWLER, Intersections of Random Walks, Birkhäuser Boston Inc., Boston, MA (1991).
8. R. LYONS, A bird's-eye view of uniform spanning trees and forests, in Microsurveys in Discrete Probability (Princeton, NJ, 1997), DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 41, 135-163, A. M. S., Providence, RI (1998).
9. R. LYONS, Y. PERES, and O. SCHRAMM, Markov chain intersections and the loop-erased walk, Ann. Inst. H. Poincaré, Probab. et Stat. 39 (2003), 779-791.
10. C. M. NEWMAN and D. STEIN, Spin-glass model with dimension-dependent ground state, Phys. Rev. Lett. 72 (1994), 2286-2289.
11. R. PEMANTLE, Choosing a spanning tree for the integer lattice uniformly, Ann. Probab. 19 (1991), 1559-1574.
12. F. SPITZER, Principles of Random Walk, second edition, Grad. Texts in Math. 34, Springer-Verlag, New York (1976).
13. H. VON WEIZSÄCKER, Exchanging the order of taking suprema and countable intersections of σ-algebras, Ann. Inst. H. Poincaré, Probab. et Stat. 19 (1983), 91-100.
14. J. A. WILLIAMSON, Random walks and Riesz kernels, Pacific J. Math. 25 (1968), 393-415.
15. D. B. WILSON, Generating random spanning trees more quickly than the cover time, in Proc. of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996), 296-303, ACM, New York (1996).
16. W. WOESS, Random Walks on Infinite Graphs and Groups, Cambridge Tracts in Math. 138, Cambridge Univ. Press, Cambridge, U.K. (2000).