Download this PDF file Fullscreen Fullscreen Off
References
- J. Balogh, B. G. Pittel, Bootstrap percolation on the random regular graph. Random Structures Algorithms 30 (2007), no. 1-2, 257--286. MR2283230
- B. Bollobás, The evolution of sparse graphs. Graph theory and Combinatorics (Cambridge, 1983), 35--57, Academic Press, London, 1984. MR0777163
- B. Bollobás, Random Graphs, 2nd ed., Cambridge Univ. Press, Cambridge, 2001. MR1864966
- T. Britton, S. Janson and A. Martin-Löf, Graphs with specified degree distributions, simple epidemics and local vaccination strategies. Advances Appl. Probab. 39 (2007), no. 4, 922--948. MR2381582
- J. Cain and N. Wormald, Encore on cores. Electronic J. Combinatorics, 13 (2006), no. 1, R81. MR2255423
- R. W. R. Darling, D. A. Levin and J. R. Norris, Continuous and discontinuous phase transitions in hypergraph processes. Random Structures Algorithms 24 (2004), no. 4, 397--419. MR2060628
- N. Fountoulakis, Percolation on sparse random graphs with given degree sequence. Preprint, 2007. arXiv:math/0703269v1
- A. Gut, Probability: A Graduate Course. Springer, New York, 2005. MR2125120
- S. Janson, The probability that a random multigraph is simple. Combin. Probab. Comput., to appear. arXiv:math.CO/0609802
- S. Janson and M. J. Luczak, A simple solution to the k-core problem. Random Structures Algorithms 30 (2007), no. 1-2, 50--62. MR2283221
- S. Janson and M. J. Luczak, Asymptotic normality of the k-core in random graphs. Ann. Appl. Probab., 18 (2008), no. 3, 1085--1137. MR2418239
- S. Janson and M. J. Luczak, A new approach to the giant component problem. Random Structures Algorithms, to appear. arXiv:0707.1786v1
- O. Kallenberg, Foundations of Modern Probability, 2nd ed., Springer, New York, 2002. MR1876169
- T. Luczak, Size and connectivity of the k-core of a random graph, Discr. Math. 91 (1991) 61--68. MR1120887
- M. Molloy and B. Reed, A critical point for random graphs with a given degree sequence, Random Structures Algorithms 6 (1995), no. 2--3, 161--179. MR1370952
- M. Molloy and 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. MR1664335
- B. Pittel, J. Spencer and N. Wormald, Sudden emergence of a giant k-core in a random graph, J. Combin. Theor. Ser. B 67 (1996), 111--151. MR1385386
- O. Riordan, The k-core and branching processes. Combin. Probab. Comput. 17 (2008), no. 1, 111--136. MR2376426

This work is licensed under a Creative Commons Attribution 3.0 License.