Abstract
We study the problem of identifying nodes that are more likely to trigger cascading failures in complex systems, which we call vulnerable nodes. We show that there is a close relation between the likelihood of a node setting off cascading failures (which we call the cascading failure probability) and its non-backtracking centrality; when every failed node is equally likely to cause the failure of each neighbor, the cascading failure probability and non-backtracking centrality of a node are proportional to each other. Based on this observation, we propose a new approach to finding vulnerable nodes and study its performance using numerical studies.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
