Mean-field conditions for percolation on finite graphs

Geometric and Functional Analysis

Volumn 19, Issue 4, 2009, Pages 1171-1194

  Nachmias, Asaf ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Giant component; Percolation; Random graphs; Scaling window

Indexed keywords

EID: 71049154050     PISSN: 1016443X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00039-009-0032-4     Document Type: Article

References (29)

1. Ajtai M., Komlós J., Szemerédi E.: Largest random component of a k-cube. Combinatorica 2, 1-17 (1982).
2. Aizenman M., Newman C. M.: Tree graph inequalities and critical behavior in percolation models. J. Stat. Phys. 44, 393-454 (1984).
3. Alon N., Benjamini I., Lubetzky E., Sodin S.: Non-backtracking random walks mix faster. Communications in Contemporary Mathematics 9, 585-603 (2007).
4. Alon N., Benjamini I.: Stacey A., Percolation on finite graphs and isoperimetric inequalities. Ann. Probab. 32, 1727-1745 (2004).
5. Alon N., Spencer J. H.: The Probabilistic Method, 2nd edition. Wiley, New York (2000).
6. Bollobás B.: The evolution of random graphs. Trans. Amer. Math. Soc. 286, 257-274 (1984).
7. Borgs C., Chayes J. T., van der Hofstad R., Slade G., Spencer J.: Random subgraphs of finite graphs: I. The scaling window under the triangle condition. Rand. Struc. Alg. 27, 137-184 (2005).
8. Borgs C., Chayes J. T., van der Hofstad R., Slade G., Spencer J.: Random subgraphs of finite graphs: II. The lace expansion and the triangle condition. Annals of Probability 33, 1886-1944 (2005).
9. Borgs C., Chayes J. T., van der Hofstad R., Slade G., Spencer J.: Random subgraphs of finite graphs: III. The phase transition for the n-cube. Combinatorica 26, 395-410 (2006).
10. Chung F. R. K., Graham R. L., Wilson R. M.: Quasi-random graphs. Combinatorica 9(4), 345-362 (1989).
11. Durrett R: Probability: Theory and Examples, Second edition. Duxbury Press, Belmont, California (1996).
12. Erdo{double acute}s P., Rényi A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Ko{double acute}zl. 5, 17-61 (1960).
13. Fill J. A.: Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1(1), 62-87 (1991).
14. Hara T., Slade G.: Mean-field critical behaviour for percolation in high dimensions. Comm. Math. Phys. 128, 333-391 (1990).
15. R. van der Hofstad, M. Luczak, Random subgraphs of the 2D Hamming graph: the supercritical phase, Probability Theory and Related Fields, to appear.
16. Hoory S., Linial N., Widgerson A.: Expander graphs and their applications. Bull. Amer. Math. Soc. 43, 439-561 (2006).
17. Karp R. M.: The transitive closure of a random digraph. Random Structures Algorithms 1, 73-93 (1990).
18. G. Kozma, A. Nachmias, An upper bound for percolation on graphs with low girth, in preparation (2007).
19. Lazebnik F., Ustimenko V. A.: Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Appl. Math. 60(1-3), 275-284 (1995).
20. Lubotzky A., Phillips R., Sarnak P.: Ramanujan graphs. Combinatorica 8(3), 261-277 (1988).
21. Łuczak T.: Component behavior near the critical point of the random graph process. Random Structures Algorithms 1, 287-310 (1990).
22. Lyons R.: Random walks, capacity and percolation on trees. Ann. Probab. 20, 2043-2088 (1992).
23. Margulis G. A.: Explicit constructions of graphs without short cycles and low density codes. Combinatorica 2(1), 71-78 (1982).
24. Martin-Löf A.: Symmetric sampling procedures, general epidemic processes and their threshold limit theorems. J. Appl. Probab. 23, 265-282 (1986).
25. M. Mihail, Conductance and convergence of Markov chains - A combinatorial treatment of expander, Proceedings of the 30th Annual Conference on Foundations of Computer Science (FOCS 89) (1989), 526-531.
26. A. Nachmias, Y. Peres, Critical percolation on random regular graphs, Random Structures and Algorithms, to appear; http://www.arxiv.org/abs/0707. 2839.
27. Nachmias A., Peres Y.: Critical random graphs: diameter and mixing time. Annals of Probability 36(4), 1267-1286 (2008).
28. Peres Y.: Probability on trees: an introductory climb, Ecole d'été de Probabilités de Saint-Flour XXVII. Springer Lect. Notes Math. 1717, 193-280 (1999).
29. Pittel B.: Edge percolation on a random regular graph of low degree. Annals of Probability 36(4), 1359-1389 (2008).