Measuring cascade effects in coupled networks using algebraic connectivity

Understanding how the underlying network structure and interconnectivity impact on robustness of the coupled networks is a major challenge in complex networks studies. There are some existing metrics that can be used to measure network robustness. However, different metrics such as the average node degree, interpret different characteristic of network topological structure, especially less metrics have been identified to effectively measure the cascade performance in coupled networks. In this paper, we propose to use a combined Laplacian matrix to model the coupled networks and their interconnectivity, and then use its algebraic connectivity metric as a measure to its cascading behavior. Moreover, we have conducted extensive comparative studies among different metrics such as the average node degree, and the proposed algebraic connectivity. We have found that the algebraic connectivity metric can describe more accurate and finer characteristics on topological structure of coupled networks than other metrics widely adapted by the existing research studies for measuring the cascading performance in coupled networks.

[1]  Zhen Jin,et al.  Epidemic spreading on complex networks with community structure , 2012, Appl. Math. Comput..

[2]  E A Leicht,et al.  Suppressing cascades of load in interdependent networks , 2011, Proceedings of the National Academy of Sciences.

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

[4]  Ernesto Estrada,et al.  Communicability graph and community structures in complex networks , 2009, Appl. Math. Comput..

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

[6]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[7]  Priya Mahadevan,et al.  The internet AS-level topology: three data sources and one definitive metric , 2005, Comput. Commun. Rev..

[8]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[9]  Junshan Zhang,et al.  Optimal Allocation of Interconnecting Links in Cyber-Physical Systems: Interdependence, Cascading Failures, and Robustness , 2012, IEEE Transactions on Parallel and Distributed Systems.

[10]  Zhen-Xiang Han,et al.  Analysis and Comparison on Several Kinds of Models of Cascading Failure in Power System , 2005, 2005 IEEE/PES Transmission & Distribution Conference & Exposition: Asia and Pacific.

[11]  I. Kamwa,et al.  Causes of the 2003 major grid blackouts in North America and Europe, and recommended means to improve system dynamic performance , 2005, IEEE Transactions on Power Systems.

[12]  Hans J. Herrmann,et al.  Towards designing robust coupled networks , 2011, Scientific Reports.

[13]  Patrick J. Wolfe,et al.  What is a degree distribution? , 2012, ArXiv.

[14]  S. Buldyrev,et al.  Interdependent networks with identical degrees of mutually dependent nodes. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Benjamin A Carreras,et al.  Complex systems analysis of series of blackouts: cascading failure, critical points, and self-organization. , 2007, Chaos.

[16]  Minfang Peng,et al.  Minimization of ambiguity in parametric fault diagnosis of analog circuits: A complex network approach , 2012, Appl. Math. Comput..

[17]  Robert E. Kooij,et al.  Graph measures and network robustness , 2013, ArXiv.

[18]  Caterina M. Scoglio,et al.  Optimizing algebraic connectivity by edge rewiring , 2013, Appl. Math. Comput..

[19]  W. Liu,et al.  Utility of algebraic connectivity metric in topology design of survivable networks , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[20]  Hamid Sharif,et al.  A Survey on Smart Grid Communication Infrastructures: Motivations, Requirements and Challenges , 2013, IEEE Communications Surveys & Tutorials.

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

[22]  Tang,et al.  Self-organized criticality. , 1988, Physical review. A, General physics.

[23]  Tang,et al.  Self-Organized Criticality: An Explanation of 1/f Noise , 2011 .

[24]  Fan Yizheng,et al.  On Spectral Integral Variations of Graphs , 2002 .

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

[26]  Anirban Banerjee,et al.  Graph spectra as a systematic tool in computational biology , 2007, Discret. Appl. Math..

[27]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

[28]  Robert E. Kooij,et al.  Elasticity and Viral Conductance: Unveiling Robustness in Complex Networks through Topological Characteristics , 2008, ArXiv.

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