Minimal spanning forests

Annals of Probability

Volumn 34, Issue 5, 2006, Pages 1665-1692

  Lyons, Russell ^a   Peres, Yuval ^b   Schramm, Oded ^c  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Amenability; Cayley graphs; Percolation; Spanning trees

Indexed keywords

EID: 33746180665     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/009117906000000269     Document Type: Article

References (42)

1. ADAMS, S. R. and SPATZIER, R. J. (1990). Kazhdan groups, cocycles and trees. Amer. J. Math. 112 271-287. MR1047300
2. AIZENMAN, M., BURCHARD, A., NEWMAN, C. M. and WILSON, D. B. (1999). Scaling limits for minimal and random spanning trees in two dimensions. Random Structures Algorithms 15 319-367. MR1716768
3. ALDOUS, D. J. and STEELE, J. M. (1992). Asymptotics for Euclidean minimal spanning trees on random points. Probab. Theory Related Fields 92 247-258. MR1161188
4. ALDOUS, D. J. and STEELE, J. M. (2004). The objective method: Probabilistic combinatorial optimization and local weak convergence. In Probability on Discrete Structures. Encyclopaedia Math. Sci. (H. Kesten, ed.) 110 1-72. Springer, Berlin. MR2023650
5. ALEXANDER, K. S. (1995). Percolation and minimal spanning forests in infinite graphs. Ann. Probab. 23 87-104. MR1330762
6. ALEXANDER, K. S. and MOLCHANOV, S. A. (1994). Percolation of level sets for two-dimensional random fields with lattice symmetry. J. Statist. Phys. 77 627-643. MR 1301459
7. BARSKY, D. J., GRIMMETT, G. R. and NEWMAN, C. M. (1991). Percolation in half-spaces: Equality of critical densities and continuity of the percolation probability. Probab. Theory Related Fields 90 111-148. MR1124831
8. BENJAMINI, I., LYONS, R., PERES, Y. and SCHRAMM, O. (1999). Critical percolation on any nonamenable group has no infinite clusters. Ann. Probab. 27 1347-1356. MR1733151
9. BENJAMINI, I., LYONS, R., PERES, Y. and SCHRAMM, O. (1999). Group-invariant percolation on graphs. Geom. Funct. Anal. 9 29-66. MR1675890
10. BENJAMINI, I., LYONS, R., PERES, Y. and SCHRAMM, O. (2001). Uniform spanning forests. Ann. Probab. 29 1-65. MR1825141
11. d, many questions and a few answers. Electron. Comm. Probab. 1 71-82 (electronic). MR1423907
12. BENJAMINI, I. and SCHRAMM, O. (1998). Personal communication.
13. BENJAMINI, I. and SCHRAMM, O. (2001). Percolation in the hyperbolic plane. J. Amer. Math. Soc. 14 487-507. MR1815220
14. BURTON, R. M. and KEANE, M. (1989). Density and uniqueness in percolation. Comm. Math. Phys. 121 501-505. MR0990777
15. DOYLE, P. G. and SNELL, J. L. (1984). Random Walks and Electric Networks. Mathematical Association of America, Washington, DC. Available at http://arxiv.org/abs/math/ 0001057.MR0920811
16. 2 de relations d'équivalence et de groupes. Publ. Math. Inst. Hautes Études Sci. 95 93-150. MR1953191
17. GABORIAU, D. (2006). Invariant percolation and harmonic Dirichlet functions. GAFA. To appear.
18. GRIMMETT, G. (1999). Percolation, 2nd ed. Springer, Berlin. MR1707339
19. GRIMMETT, G. R. and MARSTRAND, J. M. (1990). The supercritical phase of percolation is well behaved. Proc. Roy. Soc. London Ser. A 430 439-457. MR1068308
20. HÄGGSTRÖM, O. (1995). Random-cluster measures and uniform spanning trees. Stochastic Process. Appl. 59 267-275. MR1357655
21. HÄGGSTRÖM, O. (1997). Infinite clusters in dependent automorphism invariant percolation on trees. Ann. Probab. 25 1423-1436. MR1457624
22. HÄGGSTRÖM, O. (1998). Uniform and minimal essential spanning forests on trees. Random Structures Algorithms 12 27-50. MR1637387
23. HÄGGSTRÖM, O. and PERES, Y. (1999). Monotonicity of uniqueness for percolation on Cayley graphs: All infinite clusters are born simultaneously. Probab. Theory Related Fields 113 273-285. MR1676835
24. HÄGGSTRÖM, O., PERES, Y. and SCHONMANN, R. H. (1999). Percolation on transitive graphs as a coalescent process: Relentless merging followed by simultaneous uniqueness. In Perplexing Problems in Probability (M. Bramson and R. Durrett, eds.) 69-90. Birkhäuser, Boston. MR1703125
25. HARA, T. and SLADE, G. (1994). Mean-field behaviour and the lace expansion. In Probability and Phase Transition (G. Grimmett, ed.) 87-122. Kluwer, Dordrecht. MR1283177
26. HARRIS, T. E. (1960). A lower bound for the critical probability in a certain percolation process. Proc. Cambridge Philos. Soc. 56 13-20. MR0115221
27. KESTEN, H. (1980). The critical probability of bond percolation on the square lattice equals 1/2. Comm. Math. Phys. 74 41-59. MR0575895
28. KESTEN, H. (1982). Percolation Theory for Mathematicians. Birkhäuser, Boston. MR0692943
29. LYONS, R. (2000). Phase transitions on nonamenable graphs. J. Math. Phys. 41 1099-1126. MR1757952
30. 2-Betti numbers. To appear.
31. LYONS, R. with PERES, Y. (2006). Probability on Trees and Networks. Cambridge Univ. Press. Available at http://mypage.iu.edu/-rdlyons/.
32. LYONS, R. and SCHRAMM, O. (1999). Indistinguishability of percolation clusters. Ann. Probab. 27 1809-1836. MR1742889
33. MORRIS, B. (2003). The components of the wired spanning forest are recurrent. Probab. Theory Related Fields 125 259-265. MR 1961344
34. NEWMAN, C. M. (1997). Topics in Disordered Systems. Birkhäuser, Basel. MR1480664
35. NEWMAN, C. M. and STEIN, D. L. (1996). Ground-state structure in a highly disordered spin-glass model. J. Statist. Phys. 82 1113-1132. MR1372437
36. PEMANTLE, R. (1991). Choosing a spanning tree for the integer lattice uniformly. Ann. Probab. 191559-1574. MR1127715
37. PEMANTLE, R. and PERES, Y. (2000). Nonamenable products are not treeable. Israel J. Math. 118 147-155. MR1776080
38. PERES, Y. and STEIF, J. E. (1998). The number of infinite clusters in dynamical percolation. Probab. Theory Related Fields III 141-165. MR1626782
39. SCHONMANN, R. H. (1999). Percolation in ∞ + 1 dimensions at the uniqueness threshold. In Perplexing Problems in Probability (M. Bramson and R. Durrett, eds.) 53-67. Birkhäuser, Boston. MR 1703124
40. SCHONMANN, R. H. (1999). Stability of infinite clusters in supercritical percolation. Probab. Theory Related Fields 113 287-300. MR1676831
41. TIMÁR, A. (2006). Ends in free minimal spanning forests. Ann. Probab. 34 865-869.
42. VAN DEN BERG, J. and KESTEN, H. (1985). Inequalities with applications to percolation and reliability. J. Appl. Probab. 22 556-569. MR0799280