On percolation in random graphs with given vertex degrees

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.

[1]  Svante Janson,et al.  A new approach to the giant component problem , 2007, Random Struct. Algorithms.

[2]  O. Kallenberg.  Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[3]  Svante Janson,et al.  A new approach to the giant component problem , 2009 .

[4]  Svante Janson,et al.  Asymptotic normality of the k-core in random graphs , 2008 .

[5]  Oliver Riordan,et al.  The k-Core and Branching Processes , 2005, Combinatorics, Probability and Computing.

[6]  Tomasz Łuczak,et al.  Size and connectivity of the k-core of a random graph , 1991 .

[7]  Gerry Leversha,et al.  Foundations of modern probability (2nd edn), by Olav Kallenberg. Pp. 638. £49 (hbk). 2002. ISBN 0 387 95313 2 (Springer-Verlag). , 2004, The Mathematical Gazette.

[8]  Svante Janson.  The Probability That a Random Multigraph is Simple , 2009, Comb. Probab. Comput..

[9]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[10]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[11]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[12]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[13]  Svante Janson,et al.  A simple solution to the k-core problem , 2007, Random Struct. Algorithms.

[14]  S. Janson,et al.  Graphs with specified degree distributions, simple epidemics, and local vaccination strategies , 2007, Advances in Applied Probability.

[15]  James R. Norris,et al.  Continuous and discontinuous phase transitions in hypergraph processes , 2004, Random Struct. Algorithms.

[16]  Nikolaos Fountoulakis,et al.  Percolation on Sparse Random Graphs with Given Degree Sequence , 2007, Internet Math..

[17]  Tomasz Luczak,et al.  Size and connectivity of the k-core of a random graph , 1991, Discret. Math..

[18]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[19]  József Balogh,et al.  Bootstrap percolation on the random regular graph , 2007, Random Struct. Algorithms.