Percolation on dense graph sequences

Annals of Probability

Volumn 38, Issue 1, 2010, Pages 150-183

  Bollobás, Béla ^a,b   Borgs, Christian ^c   Chayes, Jennifer ^c   Riordan, Oliver ^d  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c MICROSOFT RESEARCH   (United States)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Cut metric; Percolation; Random graphs

Indexed keywords

EID: 77953722489     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/09-AOP478     Document Type: Article

References (21)

1. AJTAI, M., KOMLÓS, J. and SZEMERÉDI, E. (1982). Largest random component of a k-cube. Combinatorica 2 1-7.
2. ALON, N., BENJAMINI, I. and STACEY, A. (2004). Percolation on finite graphs and isoperimetric inequalities. Ann. Probab. 32 1727-1745.
3. BENJAMINI, I. and SCHRAMM, O. (2001). Recurrence of distributional limits of finite planar graphs. Electron. J. Probab. 6 23.
4. VAN DEN BERG, J. and KESTEN, H. (1985). Inequalities with applications to percolation and reliability. J. Appl. Probab. 22 556-569.
5. BOLLOBÁS, B. (1984). The evolution of random graphs. Trans. Amer. Math. Soc. 286 257-274.
6. BOLLOBÁS, B., JANSON, S. and RIORDAN, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31 3-122.
7. BOLLOBÁS, B.,KOHAYAKAWA, Y. and ŁUCZAK, T. (1992). The evolution of random subgraphs of the cube. Random Structures Algorithms 3 55-90.
8. BORGS, C., CHAYES, J.T., VAN DER HOFSTAD, R., SLADE, G. and SPENCER, J. (2005). Random subgraphs of finite graphs. I. The scaling window under the triangle condition. Random Structures Algorithms 27 137-184.
9. BORGS, C., CHAYES, J.T., VAN DER HOFSTAD, R., SLADE, G. and SPENCER, J. (2005). Random subgraphs of finite graphs. II. The lace expansion and the triangle condition. Ann. Probab. 33 1886-1944.
10. BORGS, C., CHAYES, J.T.,VAN DER HOFSTAD, R., SLADE, G. and SPENCER, J. (2006). Random subgraphs of finite graphs. III. The phase transition for the n-cube. Combinatorica 26 395-410.
11. BORGS, C., CHAYES, J.T., KESTEN, H. and SPENCER, J. (2001). The birth of the infinite cluster: Finite-size scaling in percolation. Comm. Math. Phys. 224 153-204.
12. BORGS, C., CHAYES, J., LOVÁSZ, L., SÓS, V.T. and VESZTERGOMBI, K. (2004). Unpublished.
13. BORGS, C., CHAYES, J., LOVÁSZ, L., SÓS, V.T. and VESZTERGOMBI, K. (2006). Counting graph homomorphisms. in Topics in Discrete Mathematics. Algorithms and Combinatorics 26 315-371. Springer, Berlin
14. BORGS, C., CHAYES, J.T., LOVÁSZ, L., SÓS, V.T. and VESZTERGOMBI, K. (2008). Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing. Adv. Math. 219 1801-1851.
15. BORGS, C., CHAYES, J.T., LOVÁSZ, L., SÓS, V.T. and VESZTERGOMBI, K. (2007). Convergent sequences of dense graphs II. Multiway cuts and statistical physics. Preprint. Available at http://research.microsoft.com/~borgs/Papers/ConRight.pdf.
16. ERDO{double acute}S, P. and RÉNYI, A. (1960). On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 17-61.
17. FRIEZE, A., KRIVELEVICH, M. and MARTIN, R. (2004). The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Structures Algorithms 24 42-50.
18. LOVÁSZ, L. and SZEGEDY, B. (2006). Limits of dense graph sequences. J. Combin. Theory Ser. B 96 933-957.
19. ŁUCZAK, T. (1990). Component behavior near the critical point of the random graph process. Random Structures Algorithms 1 287-310.
20. REIMER, D. (2000). Proof of the van den Berg-Kesten conjecture. Combin. Probab. Comput. 9 27-32.
21. SZEMERÉDI, E. (1978). Regular partitions of graphs. In Problèmes Combinatoires et Théorie des Graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976). Colloq. Internat. CNRS 260 399-401. CNRS, Paris.