Explosive Percolation Is Continuous

A mathematical proof shows that in many models of the growth of network connectivity, phase transitions are continuous. “Explosive percolation” is said to occur in an evolving network when a macroscopic connected component emerges in a number of steps that is much smaller than the system size. Recent predictions based on simulations suggested that certain Achlioptas processes (much-studied local modifications of the classical mean-field growth model of Erdős and Rényi) exhibit this phenomenon, undergoing a phase transition that is discontinuous in the scaling limit. We show that, in fact, all Achlioptas processes have continuous phase transitions, although related models in which the number of nodes sampled may grow with the network size can indeed exhibit explosive percolation.

[1]  S N Dorogovtsev,et al.  Explosive percolation transition is actually continuous. , 2010, Physical review letters.

[2]  Svante Janson,et al.  Phase transitions for modified Erdős–Rényi processes , 2010, 1005.4494.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Marc Timme,et al.  Self-organized adaptation of a simple neural circuit enables complex robot behaviour , 2010, ArXiv.

[5]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[6]  Oliver Riordan,et al.  The Small Giant Component in Scale-Free Random Graphs , 2005, Combinatorics, Probability and Computing.

[7]  Tom Bohman,et al.  Emergence of Connectivity in Networks , 2009, Science.

[8]  Alan M. Frieze,et al.  Avoiding a giant component , 2001, Random Struct. Algorithms.

[9]  F. Radicchi,et al.  Explosive percolation in scale-free networks. , 2009, Physical review letters.

[10]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[11]  Eric J Friedman,et al.  Construction and analysis of random networks with explosive percolation. , 2009, Physical review letters.

[12]  Béla Bollobás,et al.  Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..

[13]  Joel H. Spencer,et al.  Birth control for giants , 2007, Comb..

[14]  B. Kahng,et al.  Percolation transitions in scale-free networks under the Achlioptas process. , 2009, Physical review letters.

[15]  Robert M Ziff,et al.  Scaling behavior of explosive percolation on the square lattice. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Michael Mitzenmacher,et al.  Local cluster aggregation models of explosive percolation. , 2010, Physical review letters.

[17]  Svante Janson,et al.  The Birth of the Giant Component , 1993, Random Struct. Algorithms.

[18]  Alan M. Frieze,et al.  Memoryless Rules for Achlioptas Processes , 2009, SIAM J. Discret. Math..

[19]  R. May,et al.  How Viruses Spread Among Computers and People , 2001, Science.

[20]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[21]  Tom Bohman,et al.  Creating a Giant Component , 2006, Comb. Probab. Comput..

[22]  B. Bollobás.  The evolution of random graphs , 1984 .

[23]  S. Bornholdt,et al.  Handbook of Graphs and Networks , 2012 .

[24]  Nicholas C. Wormald,et al.  Counting connected graphs inside-out , 2005, J. Comb. Theory, Ser. B.

[25]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[26]  Finite-size scaling theory for explosive percolation transitions. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  J. Hopcroft,et al.  Are randomly grown graphs really random? , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  O. Riordan,et al.  Achlioptas process phase transitions are continuous , 2011, 1102.5306.

[29]  Tomasz Łuczak.  Component behavior near the critical point of the random graph process , 1990 .

[30]  J. Spencer,et al.  Explosive Percolation in Random Networks , 2009, Science.

[31]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[32]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[33]  Santo Fortunato,et al.  Explosive percolation: a numerical analysis. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.