The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Blocking links to minimize contamination spread in a social network
Abstract
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, which is converse to the influence maximization problem in which the most influential nodes for information diffusion is searched in a social network. This minimization problem is more fundamental than the problem of preventing the spread of contamination by removing nodes in a network. We introduce two definitions for the contamination degree of a network, accordingly define two contamination minimization problems, and propose methods for efficiently finding good approximate solutions to these problems on the basis of a naturally greedy strategy. Using large social networks, we experimentally demonstrate that the proposed methods outperform conventional link-removal methods. We also show that unlike the case of blocking a limited number of nodes, the strategy of removing nodes with high out-degrees is not necessarily effective for these problems.
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
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810 · cited 3×
“Using large social networks, we experimentally demonstrate that the proposed methods outperform conventional link-removal methods.”
BackgroundMethod
Cited by
Cost-Efficient Strategies for Restraining Rumor Spreading in Mobile Social Networks
He, Z., Cai, Z., Yu, J., Wang, X., Sun, Y., & Li, Y. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2016.2585591 · Cited by 277
Metadata
- Authors
- Kimura, M., Saito, K., & Motoda, H.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2009-04
- Volume
- 3
- Issue
- 2
- Pages
- 1-23
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2030701825
- Cited by
- 212
- References
- 3
- FWCI
- 6.95
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Blocking links to minimize contamination spread in a social network. https://app.cochat.ai/papers/10.1145/1514888.1514892
- The paper
- Kimura, M., Saito, K., & Motoda, H. (2009). Blocking links to minimize contamination spread in a social network. ACM Transactions on Knowledge Discovery from Data. https://doi.org/10.1145/1514888.1514892
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.