Structural properties of networks grown via an Achlioptas process

After the Achlioptas process (AP), which yields the so-called explosive percolation, was introduced, the number of papers on percolation phenomena has been literally exploding. Most of the existing studies, however, have focused only on the nature of phase transitions, not paying proper attention to the structural properties of the resulting networks, which compose the main theme of the present paper. We compare the resulting network structure of the AP with random networks and find, through observations of the distributions of the shortest-path length and the betweenness centrality in the giant cluster, that the AP makes the network less clustered and more fragile. Such structural characteristics are more directly seen by using snapshots of the network structures and are explained by the fact that the AP suppresses the formation of large clusters more strongly than the random process does. These structural differences between the two processes are shown to be less noticeable in growing networks than in static ones.

[1]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[2]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Gourab Ghoshal,et al.  Bicomponents and the robustness of networks to failure. , 2007, Physical review letters.

[4]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[6]  Beom Jun Kim,et al.  Percolation properties of growing networks under an Achlioptas process , 2013 .

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

[8]  S. N. Dorogovtsev,et al.  Anomalous percolation properties of growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[11]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[12]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[13]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[14]  Peter Grassberger,et al.  Explosive percolation is continuous, but with unusual finite size behavior. , 2011, Physical review letters.

[15]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Oliver Riordan,et al.  Explosive Percolation Is Continuous , 2011, Science.

[17]  Jan Tobochnik,et al.  Properties of a random attachment growing network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Béla Bollobás,et al.  Random Graphs , 1985 .

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

[20]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[21]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[22]  B. Kahng,et al.  Suppression effect on explosive percolations , 2011, Physical review letters.

[23]  Beom Jun Kim,et al.  Continuity of the explosive percolation transition. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Beom Jun Kim,et al.  Dynamics and directionality in complex networks. , 2009, Physical review letters.

[25]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[26]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[28]  Chang-Yong Lee,et al.  Statistical self-similar properties of complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[30]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[31]  Yong-Yeol Ahn,et al.  Response network emerging from simple perturbation , 2004 .

[32]  B. Kahng,et al.  Avoiding a Spanning Cluster in Percolation Models , 2013 .