The Combined Effect of Connectivity and Dependency Links on Percolation of Networks

Percolation theory is extensively studied in statistical physics and mathematics with applications in diverse fields. However, the research is focused on systems with only one type of links, connectivity links. We review a recently developed mathematical framework for analyzing percolation properties of realistic scenarios of networks having links of two types, connectivity and dependency links. This formalism was applied to study Erdős-Rényi (ER) networks that include also dependency links. For an ER network with average degree $\bar{k}$ that is composed of dependency clusters of size s, the fraction of nodes that belong to the giant component, P∞, is given by $P_{\infty}=p^{s-1}[1-\exp{(-\bar{k}pP_{\infty})} ]^{s}$ where 1−p is the initial fraction of randomly removed nodes. Here, we apply the formalism to the study of random-regular (RR) networks and find a formula for the size of the giant component in the percolation process: P∞=ps−1(1−rk)s where r is the solution of r=ps(rk−1−1)(1−rk)+1, and k is the degree of the nodes. These general results coincide, for s=1, with the known equations for percolation in ER and RR networks respectively without dependency links. In contrast to s=1, where the percolation transition is second order, for s>1 it is of first order. Comparing the percolation behavior of ER and RR networks we find a remarkable difference regarding their resilience. We show, analytically and numerically, that in ER networks with low connectivity degree or large dependency clusters, removal of even a finite number (zero fraction) of the infinite network nodes will trigger a cascade of failures that fragments the whole network. Specifically, for any given s there exists a critical degree value, $\bar{k}_{\min}$, such that an ER network with $\bar{k}\leq \bar{k}_{\min}$ is unstable and collapse when removing even a single node. This result is in contrast to RR networks where such cascades and full fragmentation can be triggered only by removal of a finite fraction of nodes in the network.

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

[2]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[3]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

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

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

[6]  Havlin,et al.  Are Branched Polymers in the Universality Class of Percolation? , 1995, Physical review letters.

[7]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[9]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

[10]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[11]  Guido Caldarelli,et al.  Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science , 2007 .

[12]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

[13]  H. Kesten.  Percolation theory for mathematicians , 1982 .

[14]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[15]  Reuven Cohen,et al.  Stability and topology of scale-free networks under attack and defense strategies. , 2005, Physical review letters.

[16]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[17]  Shlomo Havlin,et al.  Finding a better immunization strategy. , 2008, Physical review letters.

[18]  S. Kirkpatrick.  Percolation and Conduction , 1973 .

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

[20]  Alessandro Vespignani,et al.  Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  M. Aizenman,et al.  Sharpness of the phase transition in percolation models , 1987 .

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

[23]  H. Stanley,et al.  Fractal boundaries of complex networks , 2008, 0804.1968.

[24]  H. Stanley,et al.  Structure of shells in complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Marc Barthelemy,et al.  Spatial Networks , 2010, Encyclopedia of Social Network Analysis and Mining.

[26]  Harry Eugene Stanley,et al.  Robustness of interdependent networks under targeted attack , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

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

[29]  Naeem Jan,et al.  Forest fires as critical phenomena , 1984 .

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

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

[32]  S. Havlin,et al.  Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. , 2010, Physical review letters.

[33]  B. M. Fulk.  MATH , 1992 .

[34]  R. Zallen,et al.  The Physics of Amorphous Solids: ZALLEN:PHYSICS OF AMORPHO O-BK , 2005 .

[35]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  G. Vojta.  Fractals and Disordered Systems , 1997 .

[37]  Sergey V. Buldyrev,et al.  Critical effect of dependency groups on the function of networks , 2010, Proceedings of the National Academy of Sciences.

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

[39]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[40]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[41]  Amir Bashan,et al.  Percolation in networks composed of connectivity and dependency links , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[42]  J. W. Essam,et al.  Percolation theory , 1980 .

[43]  Reuven Cohen,et al.  Complex Networks: Structure, Robustness and Function , 2010 .

[44]  P Grassberger,et al.  On the spreading of two-dimensional percolation , 1985 .

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

[46]  Reuven Cohen,et al.  Percolation in Interdependent and Interconnected Networks: Abrupt Change from Second to First Order Transition , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Lori R Hilden,et al.  Physics of amorphous solids. , 2004, Journal of pharmaceutical sciences.

[48]  Harry Eugene Stanley,et al.  Cascade of failures in coupled network systems with multiple support-dependent relations , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[49]  E. Stoll,et al.  Cluster shapes in lattice gases and percolation , 1975 .

[50]  David Bawden,et al.  Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .

[51]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[52]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[53]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

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