Epidemic thresholds in real networks
The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
How will a virus propagate in a real network? How long does it take to disinfect a network given particular values of infection rate and virus death rate? What is the single best node to immunize? Answering these questions is essential for devising network-wide strategies to counter viruses. In addition, viral propagation is very similar in principle to the spread of rumors, information, and “fads,” implying that the solutions for viral propagation would also offer insights into these other problem settings. We answer these questions by developing a nonlinear dynamical system (NLDS) that accurately models viral propagation in any arbitrary network, including real and synthesized network graphs. We propose a general epidemic threshold condition for the NLDS system: we prove that the epidemic threshold for a network is exactly the inverse of the largest eigenvalue of its adjacency matrix. Finally, we show that below the epidemic threshold, infections die out at an exponential rate. Our epidemic threshold model subsumes many known thresholds for special-case graphs (e.g., Erdös--Rényi, BA powerlaw, homogeneous). We demonstrate the predictive power of our model with extensive experiments on real and synthesized graphs, and show that our threshold condition holds for arbitrary graphs. Finally, we show how to utilize our threshold condition for practical uses: It can dictate which nodes to immunize; it can assess the effects of a throttling policy; it can help us design network topologies so that they are more resistant to viruses.
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 · cited 5×
“html • BA power-law: These are graphs with power-law degree distributions, as described in [3].”
InfluentialInfectious Diseases of Humans: Dynamics and Control
(1992) · Annals of Internal Medicine · doi:10.7326/0003-4819-117-2-174_4 · Cited by 7,746
The Mathematics of Infectious Diseases
Hethcote, H. W. (2000) · SIAM Review · doi:10.1137/s0036144500371907 · Cited by 6,687
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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Self-citationDifferential Equations, Dynamical Systems, and Linear Algebra
(1974) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)x6044-1 · Cited by 3,091
Mining the network value of customers
Domingos, P., & Richardson, M. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502525 · Cited by 2,830
The Mathematical Theory of Infectious Diseases and its applications
Ling, N. R. (1978) · Immunology · Cited by 1,934
Epidemic dynamics and endemic states in complex networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review E · doi:10.1103/physreve.63.066117 · Cited by 1,682
Efficient Immunization Strategies for Computer Networks and Populations
Cohen, R., Havlin, S., & ben-Avraham, D. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.247901 · Cited by 1,162
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
“The basic idea (Chakrabarti et al., 2008; Gómez et al., 2010; Van Mieghem et al., 2009; Wang et al., 2003) is to write down evolution equations for the probability ραi that the node i belongs to the compartment α, for any node i, assuming that the dynamic state of every node is independent of the…”
Dynamical Interplay between Awareness and Epidemic Spreading in Multiplex Networks
Granell, C., Gómez, S., & Arenas, A. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.128701 · Cited by 1,064
Statistical physics of vaccination
Wang, Z., Bauch, C. T., Bhattacharyya, S., d'Onofrio, A., Manfredi, P., Perc, M., Perra, N., Salathé, M., & Zhao, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.10.006 · Cited by 872
Activity driven modeling of time varying networks
Perra, N., Gonçalves, B., Pastor-Satorras, R., & Vespignani, A. (2012) · Scientific Reports · doi:10.1038/srep00469 · Cited by 709
“…for the definition of interaction processes based on the actual measurement of the activity of the agents forming the system, a task now made possible by the availability of time-resolved, high-quality data on the instantaneous activity of millions of agents in a wide variety of networks [33–37].”
BackgroundAnalysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks
(2016) · IEEE Control Systems · doi:10.1109/mcs.2015.2495000 · Cited by 663
Managing and Mining Graph Data
(2010) · Advances in Database Systems · doi:10.1007/978-1-4419-6045-0 · Cited by 594
What’s in a Name?: Evaluating Statistical Attacks on Personal Knowledge Questions
Bonneau, J., Just, M., & Matthews, G. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14577-3_10 · Cited by 579
Discrete-time Markov chain approach to contact-based disease spreading in complex networks
Gómez, S., Arenas, A., Borge-Holthoefer, J., Meloni, S., & Moreno, Y. (2010) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/89/38009 · Cited by 571
Coupled disease–behavior dynamics on complex networks: A review
Wang, Z., Andrews, M. A., Wu, Z.-X., Wang, L., & Bauch, C. T. (2015) · Physics of Life Reviews · doi:10.1016/j.plrev.2015.07.006 · Cited by 546
Dynamics of information diffusion and its applications on complex networks
Zhang, Z.-K., Liu, C., Zhan, X.-X., Lu, X., Zhang, C.-X., & Zhang, Y.-C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.07.002 · Cited by 484
Knowledge transfer in smart tourism destinations: Analyzing the effects of a network structure
Del Chiappa, G., & Baggio, R. (2015) · Journal of Destination Marketing & Management · doi:10.1016/j.jdmm.2015.02.001 · Cited by 400
Mohamadou, Y., Halidou, A., & Kapen, P. T. (2020) · Applied Intelligence · doi:10.1007/s10489-020-01770-9 · Cited by 333
Arenas, A., Cota, W., Gómez-Gardeñes, J., Gómez, S., Granell, C., Matamalas, J. T., Soriano-Paños, D., & Steinegger, B. (2020) · Physical Review X · doi:10.1103/physrevx.10.041055 · Cited by 326
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D., & Eliassi-Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 297
Nature of the Epidemic Threshold for the Susceptible-Infected-Susceptible Dynamics in Networks
Boguñá, M., Castellano, C., & Pastor-Satorras, R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.068701 · Cited by 291
Ferreira, S. C., Castellano, C., & Pastor-Satorras, R. (2012) · Physical Review E · doi:10.1103/physreve.86.041125 · Cited by 284
Optimal Resource Allocation for Network Protection Against Spreading Processes
Preciado, V. M., Zargham, M., Enyioha, C., Jadbabaie, A., & Pappas, G. J. (2014) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2014.2310911 · Cited by 260
Seed exchange networks for agrobiodiversity conservation. A review
Pautasso, M., Aistara, G., Barnaud, A., Caillon, S., Clouvel, P., Coomes, O. T., Delêtre, M., Demeulenaere, E., De Santis, P., Döring, T., et al. (2013) · Agronomy for Sustainable Development · doi:10.1007/s13593-012-0089-6 · Cited by 259
Spreading Processes in Multilayer Networks
Salehi, M., Sharma, R., Marzolla, M., Magnani, M., Siyari, P., & Montesi, D. (2015) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2425961 · Cited by 255
Information and Influence Propagation in Social Networks
Chen, W., Lakshmanan, L. V. S., & Castillo, C. (2013) · Synthesis lectures on data management · doi:10.2200/s00527ed1v01y201308dtm037 · Cited by 254
Model for rumor spreading over networks
Trpevski, D., Tang, W. K. S., & Kocarev, L. (2010) · Physical Review E · doi:10.1103/physreve.81.056102 · Cited by 215
Two-stage effects of awareness cascade on epidemic spreading in multiplex networks
Guo, Q., Jiang, X., Lei, Y., Li, M., Ma, Y., & Zheng, Z. (2015) · Physical Review E · doi:10.1103/physreve.91.012822 · Cited by 173
A Birthday Present Every Eleven Wallets? The Security of Customer-Chosen Banking PINs
Bonneau, J., Preibusch, S., & Anderson, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_3 · Cited by 164
Metadata
- Authors
- Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., & Faloutsos, C.
- Venue
- ACM Transactions on Information and System Security
- Published
- 2008-01
- Volume
- 10
- Issue
- 4
- Pages
- 1-26
- ISSN
- 1094-9224 (ISSN-L)
- 1557-7406
- OpenAlex
- W2112494680
- Cited by
- 787
- References
- 32
- FWCI
- 23.83
- Type
- journal article
- Language
- en
- Open access
- closed
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.