The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
The effect of network topology on the spread of epidemics
Abstract
Many network phenomena are well modeled as spreads of epidemics through a network. Prominent examples include the spread of worms and email viruses, and, more generally, faults. Many types of information dissemination can also be modeled as spreads of epidemics. In this paper we address the question of what makes an epidemic either weak or potent. More precisely, we identify topological properties of the graph that determine the persistence of epidemics. In particular, we show that if the ratio of cure to infection rates is larger than the spectral radius of the graph, then the mean epidemic lifetime is of order log n, where n is the number of nodes. Conversely, if this ratio is smaller than a generalization of the isoperimetric constant of the graph, then the mean epidemic lifetime is of order e/sup na/, for a positive constant a. We apply these results to several network topologies including the hypercube, which is a representative connectivity graph for a distributed hash table, the complete graph, which is an important connectivity graph for BGP, and the power law graph, of which the AS-level Internet graph is a prime example. We also study the star topology and the Erdos-Renyi graph as their epidemic spreading behaviors determine the spreading behavior of power law graphs.
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
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
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
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
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
The average distances in random graphs with given expected degrees
Chung, F., & Lu, L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.252631999 · Cited by 885
Epidemic spreading in real networks: an eigenvalue viewpoint
Wang, Y., Chakrabarti, D., Wang, C., & Faloutsos, C. (2004) · 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings. · doi:10.1109/reldis.2003.1238052 · Cited by 837
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
Brémaud, P. (1999) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-3124-8 · Cited by 781
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
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
Graph Signal Processing: Overview, Challenges, and Applications
Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., & Vandergheynst, P. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2820126 · Cited by 1,787
Van Mieghem, P., Omic, J., & Kooij, R. (2009) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.925623 · Cited by 1,040
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
Rumors in a Network: Who's the Culprit?
Shah, D., & Zaman, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2158885 · Cited by 691
Metadata
- Authors
- Ganesh, A., Massoulie, L., & Towsley, D.
- Venue
- Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
- Publisher
- IEEE
- Published
- 2005-08-24
- Volume
- 2
- Pages
- 1455-1466
- OpenAlex
- W1914027636
- Cited by
- 734
- References
- 15
- FWCI
- 52.53
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The effect of network topology on the spread of epidemics. https://app.cochat.ai/papers/10.1109/infcom.2005.1498374
- The paper
- Ganesh, A., Massoulie, L., & Towsley, D. (2005). The effect of network topology on the spread of epidemics. Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. https://doi.org/10.1109/infcom.2005.1498374
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.