Abstract
Network robustness against cascades is a major topic in the fields of complex networks. In this paper, we propose an attack-cost-based cascading failure model, where the attack cost of nodes is positively related to its degree. We compare four attacking strategies: the random removal strategy (RRS), the low-degree removal strategy (LDRS), the high-degree removal strategy (HDRS) and the genetic algorithm removal strategy (GARS). It is shown that the network robustness against cascades is heavily affected by attack costs and the network exhibits the weakest robustness under GARS. We also explore the relationship between the network robustness and tolerance parameter under these attacking strategies. The simulation results indicate that the critical value of tolerance parameter under GARS is greatly larger than that of other attacking strategies. Our work can supply insight into the robustness and vulnerability of complex networks corresponding to cascading failures.
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 callMore From: International Journal of Computational Intelligence Systems
Disclaimer: 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.
