Identifying Vulnerable Nodes to Cascading Failures: Optimization-Based Approach

被引:0
作者
La, Richard J. [1 ]
机构
[1] Univ Maryland, College Pk, MD 20742 USA
来源
COMPLEX NETWORKS AND THEIR APPLICATIONS VIII, VOL 1 | 2020年 / 881卷
关键词
Cascading failures; Optimization; Robustness;
D O I
10.1007/978-3-030-36687-2_64
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A key challenge to ensuring robustness of complex systems is to correctly identify component systems, which we simply call nodes, that are more likely to trigger cascading failures. A recent approach takes advantage of the relationship between the cascading failure probability and the non-backtracking centrality of nodes when the Perron-Frobenius (P-F) eigenvalue of the associated non-backtracking matrix is close to one. However, this assumption is not guaranteed to hold in practice. Motivated by this observation, we propose a new approach that does not require the P-F eigenvalue to be close to one, and demonstrate that it offers good accuracy and outperforms the non-backtracking centrality-based approach for both synthetic and real networks.
引用
收藏
页码:773 / 782
页数:10
相关论文
共 14 条
[1]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[2]  
[Anonymous], 2013, Matrix analysis, DOI DOI 10.1017/CBO9780511840371
[3]  
[Anonymous], 2014, Convex Optimiza- tion
[4]   The diameter of a scale-free random graph [J].
Bollobás, B ;
Riordan, O .
COMBINATORICA, 2004, 24 (01) :5-34
[5]  
La R.J, 2018, P 7 INT C COMPLEX NE
[6]   Influence of Clustering on Cascading Failures in Interdependent Systems [J].
La, Richard J. .
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2019, 6 (03) :351-363
[7]   Localization and centrality in networks [J].
Martin, Travis ;
Zhang, Xiao ;
Newman, M. E. J. .
PHYSICAL REVIEW E, 2014, 90 (05)
[8]   A CRITICAL-POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE [J].
MOLLOY, M ;
REED, B .
RANDOM STRUCTURES & ALGORITHMS, 1995, 6 (2-3) :161-179
[9]   The size of the giant component of a random graph with a given degree sequence [J].
Molloy, M ;
Reed, B .
COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (03) :295-305
[10]   Mixing patterns in networks [J].
Newman, MEJ .
PHYSICAL REVIEW E, 2003, 67 (02) :13