Percolation on finite graphs and isoperimetric inequalities

Annals of Probability

Volumn 32, Issue 3 A, 2004, Pages 1727-1745

  Alon, Noga ^a   Benjamin, Itai ^b   Stacey, Alan ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Expander; Giant component; Percolation; Random graph

Indexed keywords

EID: 4544271923     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/009117904000000414     Document Type: Article

References (26)

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. (1991). A parallel algorithmic version of the local lemma. Random Structures Algorithms 2 367-378.
3. ALON, N. and CHUNG, F. R. K. (1988). Explicit construction of linear sized tolerant networks. Discrete Math. 72 15-19.
4. ALON, N. and SPENCER, J. H. (2000). The Probabilistic Method, 2nd ed. Wiley, New York.
5. BABAI, L. and SZEGEDY, M. (1992). Local expansion of symmetrical graphs. Combin. Probab. Comput. 1 1-11.
6. BEHRENDS, E. (1999). Introduction to Markov Chains with Special Emphasis on Rapid Mixing. Vieweg, Wiesbaden.
7. d, many questions and a few answers. Electron. Comm. Probab. 171-82.
8. BOLLOBÁS, B. (1984). The evolution of random graphs. Trans. Amer. Math. Soc. 286 257-274.
9. BOLLOBÁS, B. (2001). Random Graphs, 2nd ed. Academic Press, London.
10. BOLLOBÁS, B. and KOHAYAKAWA, Y. (1994). Percolation in high dimensions. European J. Combin. 15 113-125.
11. FALCONER, K. J. and GRIMMETT, G. R. (1992). On the geometry of random Cantor sets and fractal percolation. J. Theoret. Probab. 5 465-485.
12. FRIEDGUT, E. and KALAI, G. (1996). Every monotone graph property has a sharp threshold. Proc. Amer. Math. Soc. 124 2993-3002.
13. GERL, P. (1988). Random walks on graphs with a strong isoperimetric inequality. J. Theoret. Probab. 1 171-187.
14. GRIMMETT, G. (1989). Percolation. Springer, New York.
15. HARA, T. and SLADE, G. (1990). Mean-field critical phenomena for percolation in high dimensions. Comm. Math. Physics 128 333-391.
16. HARRIS, T. (1963). The Theory of Branching Processes. Springer, Berlin.
17. JANSON, S., ŁUCZAK, T. and RUCINSKI, A. (2000). Random Graphs. Wiley, New York.
18. KESTEN, H. (1990). Asymptotics in high dimension for percolation. In Disorder in Physical Systems (G. R. Grimmett and D. J. A. Welsh, eds.) 219-240. Oxford Univ. Press.
19. LIGGETT, T., SCHONMANN, R. and STACEY, A. (1997). Domination by product measures. Ann. Probab. 25 71-95.
20. LUBOTZKY, A. (1994). Discrete Groups, Expanding Graphs, and Invariant Measures. Birkhäuser, Basel.
21. LYONS, R. (2000). Phase transitions on nonamenable graphs. Probabilistic techniques in equilibrium and nonequilibrium statistical physics. J. Math. Phys. 41 1099-1126.
22. LYONS, R. and SCHRAMM, O. (1999). Indistinguishability of percolation clusters. Ann. Probab. 27 1809-1836.
23. MALON, C. and PAK, I. (2002). Percolation on finite Cayley graphs. Lecture Notes in Comput. Sci. 2483 91-104. Springer, Berlin.
24. REINGOLD, O., VADHAN, S. and WIGDERSON, A. (2002). Entropy waves, the zig-zag graph product, and new constant-degree expanders. Ann. of Math. (2) 155 157-187.
25. STACEY, A. (2001). The contact process on finite trees. Probab. Theory Related Fields 121 551-576.
26. UPFAL, E. (1994). Tolerating linear number of faults in networks of bounded degree. Inform. and Comput. 115 312-320.