On percolation in random graphs with given vertex degrees

Electronic Journal of Probability

Volumn 14, Issue , 2009, Pages 87-118

  Janson, Svante ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Bootstrap percolation; Giant component; K core; Random graph

Indexed keywords

EID: 62649110761     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v14-603     Document Type: Article

References (18)

1. J. Balogh, B. G. Pittel, Bootstrap percolation on the random regular graph. Random Structures Algorithms 30 (2007), no. 1-2, 257-286.
2. B. Bollobas, The evolution of sparse graphs. Graph theory and Combinatorics (Cambridge, 1983), 35-57, Academic Press, London, 1984.
3. B. Bollobas, Random Graphs, 2nd ed., Cambridge Univ. Press, Cambridge, 2001.
4. T. Britton, S. Janson & A. Martin-Lof, Graphs with specified degree distributions, simple epidemics and local vaccination strategies. Advances Appl. Probab. 39 (2007), no. 4, 922-948.
5. J. Cain & N. Wormald, Encore on cores. Electronic J. Combinatorics, 13 (2006), no. 1, R81.
6. R. W. R. Darling, D. A. Levin & J. R. Norris, Continuous and discontinuous phase transitions in hypergraph processes. Random Structures Algorithms 24 (2004), no. 4, 397-419.
7. N. Fountoulakis, Percolation on sparse random graphs with given degree sequence. Preprint, 2007.arXiv:math/0703269v1.
8. A. Gut, Probability: A Graduate Course. Springer, New York, 2005.
9. S. Janson, The probability that a random multigraph is simple. Combin. Probab. Comput., to appear. arXiv:math./0609802.
10. S. Janson & M. J. Luczak, A simple solution to the k-core problem. Random Structures Algorithms 30 (2007), 50-62.
11. S. Janson & M. J. Luczak, Asymptotic normality of the k-core in random graphs. Ann. Appl. Probab., 18 (2008), no. 3, 1085-1137.
12. S. Janson & M. J. Luczak, A new approach to the giant component problem. Random Structures Algorithms, to appear. arXiv:0707.1786v1.
13. O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer-Verlag, New York, 2002.
14. T. Luczak, Size and connectivity of the k-core of a random graph, Discr. Math. 91 (1991) 61-68.
15. M. Molloy & B. Reed, A critical point for random graphs with a given degree sequence, Random Structures Algorithms 6 (1995), no. 2-3, 161-179.
16. M. Molloy & B. Reed, The size of the giant component of a random graph with a given degree sequence, Combin. Probab. Comput. 7 (1998), no. 3, 295-305.
17. B. Pittel, J. Spencer & N. Wormald, Sudden emergence of a giant k-core in a random graph, J. Combin. Theor. Ser. B 67 (1996), 111-151.
18. O. Riordan, The k-core and branching processes. Combin. Probab. Comput. 17 (2008), no. 1, 111-136.