A study of rumor control strategies on social networks
The DOI matches its Crossref record.
Abstract
In this paper we study and evaluate rumor-like methods for combating the spread of rumors on a social network. We model rumor spread as a diffusion process on a network and suggest the use of an "anti-rumor" process similar to the rumor process. We study two natural models by which these anti-rumors may arise. The main metrics we study are the belief time, i.e., the duration for which a person believes the rumor to be true and point of decline, i.e., point after which anti-rumor process dominates the rumor process. We evaluate our methods by simulating rumor spread and anti-rumor spread on a data set derived from the social networking site Twitter and on a synthetic network generated according to the Watts and Strogatz model. We find that the lifetime of a rumor increases if the delay in detecting it increases, and the relationship is at least linear. Further our findings show that coupling the detection and anti-rumor strategy by embedding agents in the network, we call them beacons, is an effective means of fighting the spread of rumor, even if these beacons do not share information.
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
The spread of true and false news online
Vosoughi, S., Roy, D., & Aral, S. (2018) · Science · doi:10.1126/science.aap9559 · Cited by 8,847
Dynamics of information diffusion and its applications on complex networks
Zhang, Z.-K., Liu, C., Zhan, X.-X., Lu, X., Zhang, C.-X., & Zhang, Y.-C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.07.002 · Cited by 484
False Information on Web and Social Media: A Survey
Kumar, S., & Shah, N. (2018) · arXiv · doi:10.48550/arxiv.1804.08559 · Cited by 289
“Propagation-modeling algorithms create information spread models for true information and use these models to identify false information [3, 18, 41, 64, 103, 110, 112].”
BackgroundCost-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
The Web of False Information: Rumors, Fake News, Hoaxes, Clickbait, and Various Other Shenanigans
Zannettou, S., Sirivianos, M., Blackburn, J., & Kourtellis, N. (2019) · Journal of Data and Information Quality · doi:10.1145/3309699 · Cited by 86
“[177] propose a process, called “anti-rumor,” which aims to mitigate the spreading of a rumor in a network.”
Background
Metadata
- Authors
- Tripathy, R. M., Bagchi, A., & Mehta, S.
- Venue
- Proceedings of the 19th ACM international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2010-10-26
- Pages
- 1817-1820
- OpenAlex
- W2076718192
- Cited by
- 150
- References
- 0
- FWCI
- 3.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: A study of rumor control strategies on social networks. https://app.cochat.ai/papers/10.1145/1871437.1871737
- The paper
- Tripathy, R. M., Bagchi, A., & Mehta, S. (2010). A study of rumor control strategies on social networks. Proceedings of the 19th ACM international conference on Information and knowledge management. https://doi.org/10.1145/1871437.1871737
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.