Evaluation of network robustness using a node tearing algorithm

• Published in: Physica A Vol. 391; no. 24; pp. 6674 - 6681
• Main Authors: Ma, A., Mondragón, R.J.
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 15.12.2012
• Subjects: Algorithms; Boundaries; Communities; Community; Hierarchies; Neighbouring; Network connectivity; Network tearing; Networks; Robustness; Tearing; Vulnerability in complex networks; Network tearing; Network connectivity; Vulnerability in complex networks; Community
• ISSN: 0378-4371; 1873-2119
• DOI: 10.1016/j.physa.2012.07.058

Until recently the study of failure and vulnerability in complex networks focused on the role of high degree nodes, and the relationship between their removal and network connectivity. Recent evidence suggested that in some network configurations, the removal of lower degree nodes can also cause network fragmentation. We present a disassembling algorithm that identifies nodes that are core to network connectivity. The algorithm is based on network tearing in which communities are defined and used to construct a hierarchical structure. Cut-nodes, which are located at the boundaries of the communities, are the key interest. Their importance in the overall network connectivity is characterized by their participation with neighbouring communities in each level of the hierarchy. We examine the impact of these cut-nodes by studying the change in size of the giant component, local and global efficiencies, and how the algorithm can be combined with other community detection methods to reveal the finer internal structure within a community. ► Network tearing is used to reveal the overall network structure and configuration. ► Nodes in between communities, referred to as cut-nodes, are key to network stability. ► Cut-nodes are not limited to high centrality nodes. ► Ranking strategies based on network structure can be used to identify cut-nodes. ► Removal of cut-nodes will fragment a network aggressively.