Sensitivity of the resilience of congested random networks to rolloff and offset in truncated power-law degree distributions

Random networks were generated with the random configuration model with prescribed truncated power-law degree distributions, parameterized by an exponent, an offset, and an exponential rolloff. As a model of an attack, each network had exactly one of its highest degree nodes removed, with the result that in some cases, one or more remaining nodes became congested with the reassignment of the load. The congested nodes were then removed, and the “cascade failure” process continued until all nodes were uncongested. The ratio of the number of nodes of the largest remaining cluster to the number of nodes in the original network was taken to be a measure of the network's resiliency to highest-degree node removal. We found that the resiliency is sensitive to both rolloff and offset (but not to cutoff) in the degree distribution, and that rolloff tends to decrease resiliency while offset tends to increase it.

[1]  Petter Holme,et al.  Congestion and Centrality in Traffic Flow on Complex Networks , 2003, Adv. Complex Syst..

[2]  Frank Harary,et al.  Graph Theory , 2016 .

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

[4]  Henrik Jeldtoft Jensen,et al.  Self-Organized Criticality: Emergent Complex Behavior in Physical and Biological Systems , 1998 .

[5]  R. Otter The Number of Trees , 1948 .

[6]  Adilson E Motter Cascade control and defense in complex networks. , 2004, Physical review letters.

[7]  P. Gennes Scaling Concepts in Polymer Physics , 1979 .

[8]  T. E. Harris,et al.  The Theory of Branching Processes. , 1963 .

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

[10]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[11]  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.

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

[13]  M. Kendall,et al.  Kendall's advanced theory of statistics , 1995 .

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

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

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

[17]  Stefano Mossa,et al.  Truncation of power law behavior in "scale-free" network models due to information filtering. , 2002, Physical review letters.

[18]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[19]  Reuven Cohen,et al.  Percolation critical exponents in scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Claude M. Penchina,et al.  The Braess paradox in mechanical, traffic, and other networks , 2003 .