Electronic Journal of Probability

On percolation in random graphs with given vertex degrees

Svante Janson

Full-text: Open access


We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for random graphs with given vertex degrees. This is used to study existence of giant component and existence of k-core. As a variation of the latter, we study also bootstrap percolation in random regular graphs. We obtain both simple new proofs of known results and new results. An interesting feature is that for some degree sequences, there are several or even infinitely many phase transitions for the k-core.

Article information

Electron. J. Probab., Volume 14 (2009), paper no. 5, 86-118.

Accepted: 20 January 2009
First available in Project Euclid: 1 June 2016

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60C05: Combinatorial probability
Secondary: 05C80: Random graphs [See also 60B20]

random graph giant component k-core bootstrap percolation

This work is licensed under aCreative Commons Attribution 3.0 License.


Janson, Svante. On percolation in random graphs with given vertex degrees. Electron. J. Probab. 14 (2009), paper no. 5, 86--118. doi:10.1214/EJP.v14-603. https://projecteuclid.org/euclid.ejp/1464819466

Export citation


  • J. Balogh, B. G. Pittel, Bootstrap percolation on the random regular graph. Random Structures Algorithms 30 (2007), no. 1-2, 257–286.
  • B. Bollobás, The evolution of sparse graphs. Graph theory and Combinatorics (Cambridge, 1983), 35–57, Academic Press, London, 1984.
  • B. Bollobás, Random Graphs, 2nd ed., Cambridge Univ. Press, Cambridge, 2001.
  • 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.
  • J. Cain and N. Wormald, Encore on cores. Electronic J. Combinatorics, 13 (2006), no. 1, R81.
  • 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.
  • 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.
  • 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.
  • S. Janson and M. J. Luczak, Asymptotic normality of the k-core in random graphs. Ann. Appl. Probab., 18 (2008), no. 3, 1085–1137.
  • 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.
  • T. Luczak, Size and connectivity of the k-core of a random graph, Discr. Math. 91 (1991) 61–68.
  • 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.
  • 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.
  • 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.
  • O. Riordan, The k-core and branching processes. Combin. Probab. Comput. 17 (2008), no. 1, 111–136.