Name
Abstract | ||
|---|---|---|
We investigate the structural vulnerability of complex networks under different edge-based attacks. The attacks are induced by removing a certain ratio of edges according to four kinds of weighting methods strategies introduced, which also can describe the characteristics of links. Two metrics (the relative size of the giant component in network, the average length of shortest path) are measured. The simulations demonstrate that, the edges with higher product of betweenness centrality of the two endpoints of one edge connected are more important for SF network, ER random network, autonomous system network(AS), Italy power grid and US airport networks, but the edges with higher edge betweenness centrality are more important for WS networks. Moreover, the edges with higher edge betweenness centrality for SF network and those with higher k-shell index for AS networks are also important. The findings highlight the identification of structural key links for protecting real-world networks. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/DSC.2018.00065 | 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC) |
Keywords | Field | DocType |
vulnerability, attacks, k-shell, betweenness centrality, complex networks | Topology,Weighting,Random graph,Shortest path problem,Computer science,Giant component,Robustness (computer science),Betweenness centrality,Complex network,Autonomous system (mathematics) | Conference |
ISBN | Citations | PageRank |
978-1-5386-4211-5 | 0 | 0.34 |
References | Authors | |
5 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shudong Li | 1 | 47 | 12.98 |
| Xiaobo Wu | 2 | 9 | 4.88 |
| Aiping Li | 3 | 0 | 0.34 |
| Bin Zhou | 4 | 341 | 30.99 |
| Zhi-Hong Tian | 5 | 312 | 52.75 |
| Dawei Zhao | 6 | 193 | 20.38 |