Random subgraphs of finite graphs: I. The scaling window under the triangle condition

Random Structures and Algorithms

Volumn 27, Issue 2, 2005, Pages 137-184

  Borgs, Christian ^a   Chayes, Jennifer T ^a   Van Der Hofstad, Remco ^b   Slade, Gordon ^c   Spencer, Joel ^d  

^a MICROSOFT RESEARCH   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^d POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26944446964     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20051     Document Type: Article

References (33)

1. M. Aizenman, On the number of incipient spanning clusters, Nucl Phys B [FS], 485 (1997), 551-582.
2. M. Aizenman and D. J. Barsky, Sharpness of the phase transition in percolation models, Comm Math Phys 108 (1987), 489-526.
3. M. Aizenman and R. Fernández, On the critical behavior of the magnetization in high dimensional Ising models, J Stat Phys 44 (1986), 393-454.
4. M. Aizenman and C. M. Newman, Tree graph inequalities and critical behavior in percolation models, J Stat Phys 36 (1984), 107-143.
5. M. Ajtai, J. Komlós, and E. Szemerédi, Largest random component of a k-cube, Combinatorica 2 (1982), 1-7.
6. N. Alon, I. Benjamini, and A. Stacey, Percolation on finite graphs and isoperimetric inequalities, Ann Probab 32 (2004), 1727-1745.
7. D. J. Barsky and M. Aizenman, Percolation critical exponents under the triangle condition, Ann Probab 19 (1991), 1520-1536.
8. J. van den Berg and U. Fiebig, Inequalities with applications to percolation and reliability, Ann Probab 15 (1987), 354-374.
9. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
10. B. Bollobás, Y. Kohayakawa, and T. Łuczak, The evolution of random subgraphs of the cube, Random Structures Algorithms 3 (1992), 55-90.
11. C. Borgs and J. T. Chayes, The covariance matrix of the Potts model: A random cluster analysis, J Stat Phys 82 (1996), 1235-1297.
12. C. Borgs, J. T. Chayes, R. van der Hofstad, G. Slade, and J. Spencer, Random subgraphs of finite graphs: II. The lace expansion and the triangle condition, Ann Probab, in press.
13. C. Borgs, J. T. Chayes, R. van der Hofstad, G. Slade, and J. Spencer, Random subgraphs of finite graphs: III. The phase transition for the n-cube, Combinatorica, in press.
14. C. Borgs, J. T. Chayes, H. Kesten, and J. Spencer, The birth of the infinite cluster: Finite-size scaling in percolation, Comm Math Phys 224 (2001), 153-204.
15. J. T. Chayes and L. Chayes, Inequality for the infinite-cluster density in Bernoulli percolation, Phys Rev Lett 56 (1986), 1619-1622.
16. J. T. Chayes and L. Chayes, "The mean field bound for the order parameter of Bernoulli percolation," Percolation theory and ergodic theory of infinite particle systems, Ed. H. Kesten. Springer, New York, 1987, pp. 49-71.
17. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
18. R. Fernández, J. Fröhlich, and A. D. Sokal, Random walks, critical phenomena, and triviality in quantum field theory, Springer, Berlin, 1992.
19. A. Frieze, M. Krivelevich, and R. Martin, The emergence of a giant component in random subgraphs of pseudo-random graphs, Random Structures Algorithms 24 (2004), 42-50.
20. G. Grimmett, Percolation, 2nd edition, Springer, Berlin, 1999.
21. T. Hara, Critical two-point functions for nearest-neighbour high-dimensional self-avoiding walk and percolation, in preparation.
22. T. Hara, R. van der Hofstad, and G. Slade, Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models, Ann Probab 31 (2003), 349-408.
23. T. Hara and G. Slade, Mean-field critical behaviour for percolation in high dimensions, Commun Math Phys 128 (1990), 333-391.
24. T. Hara and G. Slade, "Mean-field behaviour and the lace expansion," Probability and phase transition, Ed. G. Grimmett. Kluwer, Dordrecht, 1994, pp. 87-122.
25. T. Hara and G. Slade, The scaling limit of the incipient infinite cluster in high-dimensional percolation. II. Integrated super-Brownian excursion, J Math Phys 41 (2000), 1244-1293.
26. T. Hara and G. Slade, The scaling limit of the incipient infinite cluster in high-dimensional percolation. I. Critical exponents, J Stat Phys 99 (2000), 1075-1168.
27. n, Random Structures Algorithms, in press.
28. n: The first three terms, Combin Probab Comput, in press.
29. S. Janson, T. Łuczak, and A. Ruciński, Random graphs, Wiley, New York, 2000.
30. T. Łuczak, Component behavior near the critical point of the random graph process, Random Structures Algorithms 1 (1990), 287-310.
31. M. V. Menshikov, Coincidence of critical points in percolation problems, Sov Math Dokl 33 (1986), 856-859.
32. R. H. Schonmann, Multiplicity of phase transitions and mean-field criticality on highly non-amenable graphs, Comm Math Phys 219 (2001), 271-322.
33. R. H. Schonmann, Mean-field criticality for percolation on planar non-amenable graphs, Comm Math Phys 225 (2002), 453-463.