Name
Abstract | ||
|---|---|---|
Vulnerabilities of complex networks have become a trend topic in complex systems due to its applications to real-world problems. Most real networks tend to be very fragile to sequential attacks such as high-degree adaptive or collective influence. However, recent contributions have shown the importance of interconnected nodes in the integrity of networks and module-based attacks have appeared very promising when compared to traditional malicious non-adaptive attacks. In this article, we study in detail the trade-off between robustness and running time of modern dismantling algorithms in modular networks. To do so, we introduce a generalized robustness measure and an empirical quantity aimed to guide the best choice of attack strategy in real cases, which we call the attack's performance. We show that the computational complexity of the module-based attack runs linearly as long as N-d < log N, where N-d is the number of bridges among communities and N is the size of the network. Taken into account both the generalized robustness and the computational complexity/running time we show that the non-adaptive module-based method performs better than other adaptive attacks in networks with well-defined community structures. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1093/comnet/cnx015 | JOURNAL OF COMPLEX NETWORKS |
Keywords | DocType | Volume |
complex networks, network robustness, network attack, network vulnerability, modular networks | Journal | 5 |
Issue | ISSN | Citations |
6 | 2051-1310 | 1 |
PageRank | References | Authors |
0.37 | 16 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Requião da Cunha | 1 | 4 | 1.78 |
| Sebastián Gonçalves | 2 | 4 | 2.79 |