Scaling limits for minimal and random spanning trees in two dimensions

Random Structures and Algorithms

Volumn 15, Issue 3-4, 1999, Pages 319-367

  Aizenman, Michael ^a   Burchard, Almut ^b   Newman, Charles M ^c   Wilson, David B ^d  

^a PRINCETON UNIVERSITY   (United States)

^b University of Virginia   (United States)

^c NEW YORK UNIVERSITY   (United States)

^d MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033415760     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1098-2418(199910/12)15:3/4<319::aid-rsa8>3.0.co;2-g     Document Type: Article

References (33)

1. R. Langlands, P. Pouliot, and Y. Saint-Aubin, Conformal invariance in two-dimensional percolation, Bull Amer Math Soc, 30 (1994), 1-61.
2. J. Cardy, Critical percolation in finite geometries, J Phys A 25 (1992), L201-206.
3. M. Aizenman, Scaling limit for the incipient spanning clusters, Mathematics of Multiscale Materials, IMA Volumes in Mathematics and its Applications, K. Golden, G. Grimmett, R. James, G. Milton, and P. Sen (Editors), Springer, Berlin, 1998; available at http://xxx.lanl.gov/ps/cond-mat/9611040.
4. H. Cohn, N. Elkies, and J. Propp, Local statistics for random domino tilings of the Aztec diamond, Duke Math J 85 (1996), 117-166.
5. ∼kenyon/confinv.ps.Z.
6. M. Aizenman and A. Burchard, Hölder regularity and dimension bounds for random curves, Duke Math J, 99 (1999), 419-453.
7. R. Pemantle, Choosing a spanning tree for the integer lattice uniformly, Ann Probab, 19(4) (1991), 1559-1574.
8. O. Häggström, Random-cluster measures and uniform spanning forests, Stochastic Process Appl 59 (1995), 267-275.
9. ∼rdlyons/gz/usf.ps.gz.
10. K. Alexander, Percolation and minimal spanning forests in infinite graphs, Ann Probab, 23 (1995), 87-104.
11. J. Chayes, L. Chayes, and C.M. Newman, The stochastic geometry of invasion percolation, Comm Math Phys, 101 (1985), 383-407.
12. K. Alexander, The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees, Ann Probab, 6 (1996), 466-494.
13. D.B. Wilson, Generating random spanning trees more quickly than the cover time, Proc 28th Annual ACM Symp on the Theory of Computing, 1996, p. 296-303.
14. K.S. Alexander and S.A. Molchanov, Percolation in two-dimensional random fields with lattice symmetry, J Statist Phys, 77 (1994), 627-643.
15. C.M. Newman and D.L. Stein, Spin-glass model with dimension-dependent ground state multiplicity, Phys Rev Lett, 72 (1994), 2286-2289.
16. C.M. Newman and D.L. Stein, Ground state structure in a highly disordered spin glass model, J Statist Phys, 82 (1996), 1113-1132.
17. M. Aizenman, On the number of incipient spanning clusters, Nucl Phy B, 485 (1997), 551-582.
18. B. Nienhuis, Analytical calculation of two leading exponents of the dilute Potts model, J Phys A, 15 (1982), 199-213.
19. B. Duplantier and H. Saleur, Exact determination of the percolation hull exponent in two dimensions, Phys Rev Lett, 58 (1987), 2325-2328.
20. M. Aizenman, B. Duplantier, and A. Aharony, Connectivity exponents and the external perimeter in 2D independent percolation, Phys Rev Lett 83 (1999), 1359-1362.
21. C.M. Fortuin and P.W. Kasteleyn, On the random-cluster model. I. Introduction and relation to other models, Physica, 57 (1972), 536-564.
22. B. Duplantier, Critical exponents of Manhattan Hamiltonian walks in two dimensions, from Potts and O(n) models, J Statist Phys, 49 (1987), 411-431.
23. I. Benjamini, Large scale degrees and the number of spanning clusters for the uniform spanning tree, Perplexing Probability Problems: Papers in Honor of Harry Kesten, M. Bramson and R. Durrett (Editors), Progress in Probability Series, Birkhäuser, Boston, 1999, pp. 175-183.
24. O. Schramm, Scaling limits of loop-erased random walks and random spanning trees, preprint, 1999.
25. C. Redmond and J.E. Yukich, Limit theorems and rates of convergence for Euclidean functionals, Ann Appl Probab, 4 (1994), 1057-1073.
26. 2 Tsing and Potts models, J Stat Phys 50 (1998), 1-40.
27. H. Kesten, The critical probability of the bond percolation on the square lattice equals 1/2, Comm Math Phys 74 (1980), 41-59.
28. L. Russo, A note on percolation, Z Wahrsch Verw Gebiete, 43 (1978), 39-48.
29. P. Seymour and D. Welsh, "Percolation probabilities on the square lattice," Advances in Graph Theory, Annals of Discrete Mathematics, B. Bollobás (Editor), North-Holland, Amsterdam, 1978, Vol. 3.
30. J. van den Berg and H. Kesten, Inequalities with applications to percolation and reliability, J Appl Probab, 22 (1985), 556-569.
31. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.
32. M. Burton and M. Keane, Density and uniqueness in percolation, Comm Math Phys, 121 (1989), 501-505.
33. C. McDiarmid, On the method of bounded differences, Surveys in Combinatorics, 1989 (Norwich, 1989), pp. 148-188. London Math Soc Lect Note Ser 141 (Cambridge Univ. Press, 1989).