Mitigation of malicious attacks on networks
Open accessThe DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Abstract
Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How and at which cost can one restructure the network such that it will become more robust against a malicious attack? We introduce a new measure for robustness and use it to devise a method to mitigate economically and efficiently this risk. We demonstrate its efficiency on the European electricity system and on the Internet as well as on complex networks models. We show that with small changes in the network structure (low cost) the robustness of diverse networks can be improved dramatically whereas their functionality remains unchanged. Our results are useful not only for improving significantly with low cost the robustness of existing infrastructures but also for designing economically robust network systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Efficient behavior of small-world networks
Latora, V., & Marchiori, M. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.198701 · Cited by 5,119
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051 · cited 1×
“In the original network we swap the connections of two randomly chosen edges, that is, the edges e ij and e kl , which connect node i with node j , and node k with node l , respectively, become e ik and e jl [26], only if the robustness of the network is increased, i.e., R new > R old .”
Background
Cited by
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Self-citationGlobally networked risks and how to respond
Helbing, D. (2013) · Nature · doi:10.1038/nature12047 · Cited by 1,281
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Self-citationVital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Structure and dynamics of molecular networks: A novel paradigm of drug discovery
Csermely, P., Korcsmáros, T., Kiss, H. J. M., London, G., & Nussinov, R. (2013) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2013.01.016 · Cited by 892
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Robustness of interdependent networks under targeted attack
Huang, X., Gao, J., Buldyrev, S. V., Havlin, S., & Stanley, H. E. (2011) · Physical Review E · doi:10.1103/physreve.83.065101 · Cited by 527
Self-citationAttack Robustness and Centrality of Complex Networks
Iyer, S., Killingback, T., Sundaram, B., & Wang, Z. (2013) · PLoS ONE · doi:10.1371/journal.pone.0059613 · Cited by 472
Finding key players in complex networks through deep reinforcement learning
Fan, C., Zeng, L., Sun, Y., & Liu, Y.-Y. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0177-2 · Cited by 425
Structure and dynamics of core/periphery networks
Csermely, P., London, A., Wu, L.-Y., & Uzzi, B. (2013) · Journal of Complex Networks · doi:10.1093/comnet/cnt016 · Cited by 367
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Identifying a set of influential spreaders in complex networks
Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 320
Spontaneous recovery in dynamical networks
Majdandzic, A., Podobnik, B., Buldyrev, S. V., Kenett, D. Y., Havlin, S., & Eugene Stanley, H. (2014) · Nature Physics · doi:10.1038/nphys2819 · Cited by 309
Self-citationThe extreme vulnerability of interdependent spatially embedded networks
Bashan, A., Berezin, Y., Buldyrev, S. V., & Havlin, S. (2013) · Nature Physics · doi:10.1038/nphys2727 · Cited by 308
Self-citationCyber security threat analysis and modeling of an unmanned aerial vehicle system
Javaid, A. Y., Sun, W., Devabhaktuni, V. K., & Alam, M. (2012) · 2012 IEEE Conference on Technologies for Homeland Security (HST) · doi:10.1109/ths.2012.6459914 · Cited by 304
A Critical Review of Robustness in Power Grids Using Complex Networks Concepts
Cuadra, L., Salcedo-Sanz, S., Del Ser, J., Jiménez-Fernández, S., & Geem, Z. (2015) · Energies · doi:10.3390/en8099211 · Cited by 277
Network robustness of multiplex networks with interlayer degree correlations
Min, B., Yi, S. D., Lee, K.-M., & Goh, K.-I. (2014) · Physical Review E · doi:10.1103/physreve.89.042811 · Cited by 262
Percolation in real interdependent networks
Radicchi, F. (2015) · Nature Physics · doi:10.1038/nphys3374 · Cited by 232
Generalized network dismantling
Ren, X.-L., Gleinig, N., Helbing, D., & Antulov-Fantulin, N. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1806108116 · Cited by 219
Towards designing robust coupled networks
Schneider, C. M., Yazdani, N., Araújo, N. A. M., Havlin, S., & Herrmann, H. J. (2013) · Scientific Reports · doi:10.1038/srep01969 · Cited by 184
“Recently, for single networks, it has been proposed [10] to quantify the robustness R as”
BackgroundSelf-citationAbruptness of Cascade Failures in Power Grids
Pahwa, S., Scoglio, C., & Scala, A. (2014) · Scientific Reports · doi:10.1038/srep03694 · Cited by 168
Suppressing epidemics with a limited amount of immunization units
Schneider, C. M., Mihaljev, T., Havlin, S., & Herrmann, H. J. (2011) · Physical Review E · doi:10.1103/physreve.84.061911 · Cited by 165
“where N is the size of the network [27].”
BackgroundSelf-citationDense and influential core promotion of daily viral information spread in political echo chambers
Asatani, K., Yamano, H., Sakaki, T., & Sakata, I. (2021) · Scientific Reports · doi:10.1038/s41598-021-86750-w · Cited by 18
Metadata
- Authors
- Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S., & Herrmann, H. J.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2011-02-22
- Volume
- 108
- Issue
- 10
- Pages
- 3838-3841
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W1989400610
- Cited by
- 1,023
- References
- 29
- FWCI
- 36.34
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.