The DOI matches its Crossref record.
Detecting sources of computer viruses in networks: theory and experiment
Abstract
We provide a systematic study of the problem of finding the source of a computer virus in a network. We model virus spreading in a network with a variant of the popular SIR model and then construct an estimator for the virus source. This estimator is based upon a novel combinatorial quantity which we term rumor centrality. We establish that this is an ML estimator for a class of graphs. We find the following surprising threshold phenomenon: on trees which grow faster than a line, the estimator always has non-trivial detection probability, whereas on trees that grow like a line, the detection probability will go to 0 as the network grows. Simulations performed on synthetic networks such as the popular small-world and scale-free networks, and on real networks such as an internet AS network and the U.S. electric power grid network, show that the estimator either finds the source exactly or within a few hops in different network topologies. We compare rumor centrality to another common network centrality notion known as distance centrality. We prove that on trees, the rumor center and distance center are equivalent, but on general networks, they may differ. Indeed, simulations show that rumor centrality outperforms distance centrality in finding virus sources in networks which are not tree-like.
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
Cited by
Inferring the origin of an epidemic with a dynamic message-passing algorithm
Lokhov, A. Y., Mézard, M., Ohta, H., & Zdeborová, L. (2014) · Physical Review E · doi:10.1103/physreve.90.012801 · Cited by 322
Information Source Detection in the SIR Model: A Sample-Path-Based Approach
Zhu, K., & Ying, L. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2364972 · Cited by 322
Multiple Rumor Source Detection with Graph Convolutional Networks
Dong, M., Zheng, B., Quoc Viet Hung, N., Su, H., & Li, G. (2019) · Proceedings of the 28th ACM International Conference on Information and Knowledge Management · doi:10.1145/3357384.3357994 · Cited by 119
Metadata
- Authors
- Shah, D., & Zaman, T.
- Venue
- Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2010-06-14
- Pages
- 203-214
- OpenAlex
- W2150105124
- Cited by
- 226
- References
- 0
- FWCI
- 5.34
- 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: Detecting sources of computer viruses in networks: theory and experiment. https://app.cochat.ai/papers/10.1145/1811039.1811063
- The paper
- Shah, D., & Zaman, T. (2010). Detecting sources of computer viruses in networks: theory and experiment. Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems. https://doi.org/10.1145/1811039.1811063
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.