The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Epidemic spreading in real networks: an eigenvalue viewpoint
Open accessAbstract
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite graph? How long does it take to disinfect a network given particular values of infection rate and virus death rate? We answer the first question by providing equations that accurately model virus propagation in any network including real and synthesized network graphs. We propose a general epidemic threshold condition that applies to arbitrary graphs: we prove that, under reasonable approximations, the epidemic threshold for a network is closely related to the largest eigenvalue of its adjacency matrix. Finally, for the last question, we show that infections tend to zero exponentially below the epidemic threshold. We show that our epidemic threshold model subsumes many known thresholds for special-case graphs (e.g., Erdos-Renyi, BA power-law, homogeneous); we show that the threshold tends to zero for infinite power-law graphs. We show that our threshold condition holds for arbitrary graphs.
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
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-citationMining 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
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
Self-citationThe 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
Immunization of complex networks
Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.036104 · Cited by 1,278
How to Own the Internet in Your Spare Time
Staniford, S., Paxson, V., & Weaver, N. C. (2002) · USENIX Security Symposium · Cited by 1,169
Applications of Mathematics to Medical Problems
M'Kendrick, A. G. (1925) · Proceedings of the Edinburgh Mathematical Society · doi:10.1017/s0013091500034428 · Cited by 1,157
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
Trawling the Web for emerging cyber-communities
Kumar, R., Raghavan, P., Rajagopalan, S., & Tomkins, A. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00040-7 · Cited by 1,000
The Mathematical Theory of Infectious Diseases and Its Applications
Giles, P., & Bailey, N. T. J. (1977) · Operational Research Quarterly (1970-1977) · doi:10.2307/3009004 · Cited by 937
Epidemic outbreaks in complex heterogeneous networks
Moreno, Y., Pastor‐Satorras, R., & Vespignani, A. (2002) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 823
Email networks and the spread of computer viruses
Newman, M. E. J., Forrest, S., & Balthrop, J. (2002) · Physical Review E · doi:10.1103/physreve.66.035101 · Cited by 798
Directed-graph epidemiological models of computer viruses
Kephart, J. O., & White, S. R. (2002) · Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130801 · Cited by 769
Epidemic outbreaks in complex heterogeneous networks
Moreno, Y., Pastor-Satorras, R., & Vespignani, A. (2002) · The European Physical Journal B · doi:10.1140/epjb/e20020122 · Cited by 755
Epidemic dynamics in finite size scale-free networks
Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.035108 · Cited by 697
Halting viruses in scale-free networks
Dezső, Z., & Barabási, A.-L. (2002) · Physical Review E · doi:10.1103/physreve.65.055103 · Cited by 583
Epidemic spreading in correlated complex networks
Boguñá, M., & Pastor-Satorras, R. (2002) · Physical Review E · doi:10.1103/physreve.66.047104 · Cited by 559
Ripeanu, M., Foster, I. T., & Iamnitchi, A. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0209028 · Cited by 334
BRITE: Universal Topology Generation from a User''s Perspective
Gago, A. M., Lakhina, A., Matta, I., & Byers, J. W. (2001) · OpenBU (Boston University) · Cited by 285
Epidemics and immunization in scale‐free networks
Pastor‐Satorras, R., & Vespignani, A. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch5 · Cited by 246
Mihail, M., & Papadimitriou, C. H. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45726-7_20 · Cited by 168
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
Van Mieghem, P., Omic, J., & Kooij, R. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.925623 · Cited by 1,040
SCAN: a structural clustering algorithm for networks
Xu, X., Yuruk, N., Feng, Z., & Schweiger, T. A. J. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281280 · Cited by 842
A Survey of Statistical Network Models
Goldenberg, A., Zheng, A. X., Fienberg, S. E., & Airoldi, E. M. (2010) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000005 · Cited by 819
Epidemic thresholds in real networks
Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., & Faloutsos, C. (2008) · ACM Transactions on Information and System Security · doi:10.1145/1284680.1284681 · Cited by 787
Self-citation
Metadata
- Authors
- Wang, Y., Chakrabarti, D., Wang, C., & Faloutsos, C.
- Venue
- 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2004-03-01
- Pages
- 25-34
- ISSN
- 1060-9857 (ISSN-L)
- OpenAlex
- W1501825524
- Cited by
- 837
- References
- 24
- FWCI
- 37.28
- Type
- conference paper
- 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.