Percolation on finite cayley graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2483, Issue , 2002, Pages 91-104

  Malon, Christopher ^a   Pak, Igor ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; SOLVENTS;

CAYLEY GRAPHS; LARGE GROUPS; SPECIAL CLASS;

GRAPH THEORY;

EID: 23044535033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45726-7_8     Document Type: Conference Paper

References (17)

1. Ajtai, M., Komlós, J., and Szemerédi, E. Largest random component of a k-cube. Combinatorica 2, 1 (1982), 1-7.
2. Alon, N., Benjamini, I., and Stacey, A. Percolation on finite graphs and isoperimetric inequalities. In preparation.
3. Astashkevich, A., and Pak, I. Random walks on nilpotent groups. http://www-math.mit.edu/-pak/research.html (2001).
4. Babson, E., and Benjamini, I. Cut sets and normed cohomology with applications to percolation. Proc. Amer. Math. Soc. 127, 2 (1999), 589-597.
5. Benjamini, I. Percolation on finite graphs. math.PR/0106022 (2001).
6. Benjamini, I., and Schramm, O. Percolation beyond Zd, many questions and a few answers. Electron. Comm. Probab. 1 (1996), no. 8, 71-82 (electronic).
7. Benjamini, I., and Schramm, O. Recent progress on percolation beyond Zd. http://www.wisdom.weizmann.ac.il/-schramm/papers/pyond-rep (2000).
8. Bollobás, B. Random graphs, second ed. Cambridge University Press, Cambridge, 2001.
9. Diestel, R., and Leader, I. A conjecture concerning a limit of non-Cayley graphs. J. Algebraic Combin. 14, 1 (2001), 17-25.
10. Erdos, P., and Rényi, A. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 (1960), 17-61.
11. Gorenstein, D. Finite simple groups. Plenum Publishing Corp., New York, 1982.
12. Grimmett, G. Percolation, second ed. Springer-Verlag, Berlin, 1999.
13. Hall, P. The Edmonton notes on nilpotent groups. Mathematics Department, Queen Mary College, London, 1969.
14. Janson, S., Luczak, T., and Rucinski, A. Random graphs. Wiley-Interscience, New York, 2000.
15. Krivelevich, M., Sudakov, B., and Vu, V. H. Sharpthreshold for network reliability. Combinatorics, Probability and Computing, To appear.
16. Pak, I., and Vu, V. H. On mixing of certain random walks, cutoff phenomenon and sharpthreshold of random matroid processes. Discrete Appl. Math. 110, 2-3 (2001), 251-272.
17. Shalev, A. Simple groups, permutation groups, and probability. In Proceedings of the International Congress of Mathematicians, Vol. II (Berlin, 1998) (1998), no. Extra Vol. II, pp. 129-137 (electronic).