The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Epidemic Spreading in Scale-Free Networks
Open accessAbstract
The Internet has a very complex connectivity recently modeled by the class of scale-free networks. This feature, which appears to be very efficient for a communications network, favors at the same time the spreading of computer viruses. We analyze real data from computer virus infections and find the average lifetime and persistence of viral strains on the Internet. We define a dynamical model for the spreading of infections on scale-free networks, finding the absence of an epidemic threshold and its associated critical behavior. This new epidemiological framework rationalizes data of computer viruses and could help in the understanding of other spreading phenomena on communication and social networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
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
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
Mean-field theory for scale-free random networks
Barabási, A.-L., Albert, R., & Jeong, H. (1999) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/s0378-4371(99)00291-5 · Cited by 2,255
Nonequilibrium Phase Transitions in Lattice Models
Marro, J., & Dickman, R. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511524288 · Cited by 1,515
Murray, J. D. (1993) · Springer eBooks · doi:10.1007/978-3-662-08542-4 · Cited by 1,138
Epidemics and percolation in small-world networks
Moore, C., & Newman, M. E. J. (2000) · Physical Review E · doi:10.1103/physreve.61.5678 · Cited by 948
On the properties of small-world network models
Barrat, A., & Weigt, M. (2000) · The European Physical Journal B · doi:10.1007/s100510050067 · Cited by 888
The Mathematical Theory of Infectious Diseases
Kingman, J. F. C., & Bailey, N. T. J. (1977) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403009 · Cited by 864
On the origin of power laws in Internet topologies
Medina, A., Matta, I., & Byers, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505680.505683 · Cited by 406
The fractal properties of Internet
Caldarelli, G., Marchetti, R., & Pietronero, L. (2000) · Europhysics Letters (EPL) · doi:10.1209/epl/i2000-00450-8 · Cited by 181
A short course on computer viruses
Cohen, F. B., Highland, H. J., & David, J. (1991) · Computer Fraud & Security Bulletin · doi:10.1016/0142-0496(91)90211-m · Cited by 157
Kephart, J. O., Sorkin, G. B., Chess, D. M., & White, S. R. (1997) · Scientific American · doi:10.1038/scientificamerican1197-88 · Cited by 107
Branching annihilating random walk on random regular graphs
Szabó, G. (2000) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.62.7474 · Cited by 19
Cited by
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
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Metadata
- Authors
- Pastor-Satorras, R., & Vespignani, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-04-02
- Volume
- 86
- Issue
- 14
- Pages
- 3200-3203
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2038195874
- Cited by
- 5,731
- References
- 17
- FWCI
- 56.41
- 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.