Network Robustness Analytics with Optimization

The community structure and the robustness are two important properties of networks for analyzing the functionality of complex systems. The community structure is crucial to understand the potential functionality of complex systems, while the robustness is indispensable to protect the functionality of complex systems from malicious attacks. When a network suffers from an unpredictable attack, its structural integrity would be damaged. It is essential to enhance community integrity of networks against multilevel targeted attacks. Coupled networks are extremely fragile because a node failure of a network would trigger a cascade of failures on the entire system. In reality, it is necessary to recover the damaged networks, and there are cascading failures in recovery processes. This chapter first introduces a greedy algorithm to enhance community integrity of networks against multilevel targeted attacks and then introduces a technique aiming at protecting several influential nodes for enhancing robustness of coupled networks under the recoveries.

[1]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[2]  Jie Liu,et al.  Multi-level learning based memetic algorithm for community detection , 2014, Appl. Soft Comput..

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

[4]  Jian-Wei Wang,et al.  Robustness of complex networks with the local protection strategy against cascading failures , 2013 .

[5]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[6]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[7]  Yicheng Zhang,et al.  Identifying influential nodes in complex networks , 2012 .

[8]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

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

[10]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[11]  Mahdi Jalili,et al.  Cascading Failure Tolerance of Modular Small-World Networks , 2011, IEEE Transactions on Circuits and Systems II: Express Briefs.

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

[13]  Hernán A. Makse,et al.  Spreading dynamics in complex networks , 2013, ArXiv.

[14]  An Zeng,et al.  Enhancing network robustness for malicious attacks , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Matjaz Perc,et al.  Spreading of cooperative behaviour across interdependent groups , 2013, Scientific Reports.

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

[17]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[18]  Sushil Jajodia,et al.  Recovery from Malicious Transactions , 2002, IEEE Trans. Knowl. Data Eng..

[19]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

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

[22]  Petter Holme,et al.  Onion structure and network robustness , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Maoguo Gong,et al.  Enhancing community integrity of networks against multilevel targeted attacks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[25]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[26]  Hans J. Herrmann,et al.  Onion-like network topology enhances robustness against malicious attacks , 2011 .

[27]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[28]  Kemal Akkaya,et al.  Distributed Recovery from Network Partitioning in Movable Sensor/Actor Networks via Controlled Mobility , 2010, IEEE Transactions on Computers.

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

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

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

[32]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[33]  S. Gjessing,et al.  Multiple Routing Configurations for Fast IP Network Recovery , 2009, IEEE/ACM Transactions on Networking.

[34]  H. Stanley,et al.  Spontaneous recovery in dynamical networks , 2013, Nature Physics.

[35]  Marten Scheffer,et al.  Self-organized similarity, the evolutionary emergence of groups of similar species. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[36]  My T. Thai,et al.  Detecting Critical Nodes in Interdependent Power Networks for Vulnerability Assessment , 2013, IEEE Transactions on Smart Grid.

[37]  Beom Jun Kim,et al.  Synchronization in interdependent networks. , 2011, Chaos.

[38]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.