Clique percolation

Random Structures and Algorithms

Volumn 35, Issue 3, 2009, Pages 294-322

  Bollobás, Béla ^a,b   Riordan, Oliver ^c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Critical probability; Dependent percolation

Indexed keywords

EID: 69949100717     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20270     Document Type: Article

References (18)

1. M. Ajtai, J. Komlós, and E. Szemerédi, Largest random component of a k-cube, Combinatorica 2 (1982),1-7.
2. B. Bollobás, Threshold functions for small subgraphs, Math Proc Cambridge Philos Soc 90 (1981),197-206.
3. B. Bollobás, The evolution of random graphs, Trans Amer Math Soc 286 (1984), 257-274.
4. B. Bollobás, Random graphs, 2nd edition, Cambridge University Press, Cambridge, 2001, pp. xviii+498.
5. B. Bollobás, S. Janson, and O. Riordan, The phase transition in inhomogeneous random graphs, Random Struct Algorithms 31 (2007), 3-122.
6. B. Bollobás, Y. Kohayakawa, and T. Łuczak, The evolution of random subgraphs of the cube, Random Struct Algorithms 3 (1992), 55-90.
7. C. Borgs, J. T. Chayes, R. van der Hofstad, G. Slade, and J. Spencer, Random subgraphs of finite graphs. I The scaling window under the triangle condition, Random Struct Algorithms 27 (2005),137-184.
8. 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 33 (2005), 1886-1944.
9. 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 26 (2006), 395-410.
10. I. Derényi, G. Palla, and T. Vicsek, Clique percolation in random networks, Phys Rev Lett 94 (2005),160202 (4 pages).
11. P. Erdos and A. Rényi, On the evolution of random graphs, Magyar Tud Akad Mat Kutató Int Közl 5 (1960), 17-61.
12. E. Friedgut, (with appendix by Jean Bourgain), Sharp thresholds of graph properties, and the k-sat problem, J Am Math Soc 12 (1999), 1017-1054.
13. T. E. Harris, A lower bound for the critical probability in a certain percolation process, Proc Cambridge Philos Soc 56 (1960), 13-20.
14. T. Łuczak, Component behavior near the critical point of the random graph process, Random Struct Algorithms 1 (1990), 287-310.
15. M. J. Luczak and C. McDiarmid, Bisecting sparse random graphs, Random Struct Algorithms 18 (2001),31-38.
16. G. Palla, D. Ábel, I. Farkas, P. Pollner, I. Derényi, and T. Vicsek, "k-clique percolation and clustering," Handbook of large-scale random networks, Bolyai Society Mathematical Studies, Vol. 18, B. Bollobás, R. Kozma and D. Miklós (Editors), Springer, 2009.
17. G. Palla, I. Derényi, and T. Vicsek, The critical point of k-clique percolation in the Erdo{double acute}s-Rényi graph, J Stat Phys 128 (2007), 219-227.
18. G. Palla, I. Farkas, P. Pollner, I. Derényi, and T. Vicsek, Directed network modules, New J Phys 9 (2007), 186 (21 pages).