Correlation of cascade failures and centrality measures in complex networks
Autor: | Xinghuo Yu, Ryan Ghanbari, Mahdi Jalili |
---|---|
Rok vydání: | 2018 |
Předmět: |
Computer Networks and Communications
business.industry Computer science Eigenvector centrality Closeness Complex network Machine learning computer.software_genre Topology 01 natural sciences Cascading failure 010305 fluids & plasmas Betweenness centrality Hardware and Architecture Cascade 0103 physical sciences Node (computer science) Alpha centrality Artificial intelligence 010306 general physics Centrality business computer Software Clustering coefficient |
Zdroj: | Future Generation Computer Systems. 83:390-400 |
ISSN: | 0167-739X |
DOI: | 10.1016/j.future.2017.09.007 |
Popis: | In complex networks, different nodes have distinct impact on overall functionality and resiliency against failures. Hence, identifying vital nodes is crucial to limit the size of the damage during a cascade failure process, enabling us to identify the most vulnerable nodes and to take solid protection measures to deter them from failure. In this manuscript, we study the correlation between cascade depth, i.e. the number of failed nodes as a consequence of single failure in one of the nodes, and centrality measures including degree, betweenness, closeness, clustering coefficient, local rank, eigenvector centrality, lobby index and information index. Networks behave dissimilarly against cascade failure due to their different structures. Interestingly, we find that node degree is negatively correlated with the cascade depth, meaning that failing a high-degree node has less severe effect than the case when lower-degree nodes fail. Betweenness centrality and local rank show positive correlation with the cascade depth. In order to make networks more resilient against cascade failures, one can remove nodes that ranked high in terms of those centrality measures showing negative correlation with the cascade depth. |
Databáze: | OpenAIRE |
Externí odkaz: |