The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

Probability Theory and Related Fields

Volumn 144, Issue 3-4, 2009, Pages 319-370

  Schweinsberg, Jason ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Continuum random tree; Loop erased random walk; Uniform spanning tree

Indexed keywords

EID: 64749083807     PISSN: 01788051     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00440-008-0149-7     Document Type: Article

References (18)

1. D. Aldous 1991 The continuum random tree I Ann. Probab. 19 1 28
2. D. Aldous 1993 The continuum random tree III Ann. Probab. 21 248 289
3. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. Book in preparation, available at http://www.stat.berkeley.edu/users/ aldous/RWG/book.html
4. I. Benjamini G. Kozma 2005 Loop-erased random walk on a torus in dimensions 4 and above Commun. Math. Phys. 259 257 286
5. Durrett R. (2005). Probability: Theory and Examples, 3rd edn. Brooks/Cole, Belmont
6. Feder, T., Mihail, M.: Balanced Matroids. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 26-38 (1992)
7. Janson S., Łuczak T. and Ruciński A. (2000). Random Graphs. Wiley, New York
8. G. Kozma 2007 The scaling limit of loop-erased random walk in three dimensions Acta. Mathematica. 199 29 152
9. Lawler G. (1991). Intersections of Random Walks. Birkhäuser, Boston
10. G. Lawler 1992 Escape probabilities for slowly recurrent sets Probab. Theory Related Fields 94 91 117
11. Lawler, G.: The logarithmic correction for loop-erased walk in four dimensions. In: Proceedings of the conference in honor of Jean-Pierre Kahane. J. Fourier Anal. Appl. 347-361 (1995)
12. G. Lawler O. Schramm W. Werner 2004 Conformal invariance of planar loop-erased random walks and uniform spanning trees Ann. Probab. 32 939 995
13. R. Lyons Y. Peres O. Schramm 2003 Markov chain intersections and the loop-erased walk Ann. Inst. H. Poincaré Probab. Stat. 39 779 791
14. R. Pemantle 1991 Choosing a spanning tree for the integer lattice uniformly Ann. Probab. 19 1559 1574
15. Peres, Y., Revelle, D.: Scaling limits of the uniform spanning tree and loop-erased random walk on finite graphs. Preprint, available at http://front.math.ucdavis.edu/0410430 (2004)
16. Saloff-Coste, L.: Random walks on finite groups. In: Probabililty on Discrete Structures, Encyclopaedia of Mathematical Sciences, Vol. 110. Springer, Berlin (2004)
17. Schweinsberg, J.: Loop-erased random walk on finite graphs and the Rayleigh process. J. Theor. Probab. (2008) (to appear)
18. Wilson, D.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 296-303 (1996)