Comparison of cascading failures in small-world and scale-free networks subject to vertex and edge attacks

Autor:	G.Z. Wang, Yigang Cao, L.J. Ding, Zhejing Bao
Rok vydání:	2009
Předmět:	Statistics and Probability Vertex (graph theory) Small-world network Computer science business.industry Scale-free network Complex network Condensed Matter Physics business Cascading failure MathematicsofComputing_DISCRETEMATHEMATICS Computer network
Zdroj:	Physica A: Statistical Mechanics and its Applications. 388:4491-4498
ISSN:	0378-4371
DOI:	10.1016/j.physa.2009.07.017
Popis:	Complex networks may undergo a global cascade of overload failures when a single highly loaded vertex or edge is intentionally attacked. Here we use the recent load model of cascading failures to investigate the performance of the small-world (SW) and scale-free (SF) networks subject to deliberate attacks on vertex and edge. Simulation results suggest that compared with the SW network, the SF network is more vulnerable to deliberate vertex attacks and more robust to deliberate edge attacks. In the SF network, deliberate vertex attacks can result in larger cascading failures than deliberate edge attacks; however, in the SW network the situation is opposite. Furthermore, with the increase of the rewiring probability the SW network becomes more and more robust to deliberate vertex and edge attacks.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::cf1277ef25e17595bc7d7ad01803fd28 https://doi.org/10.1016/j.physa.2009.07.017 Full Text from ScienceDirect