Modeling Propagation Dynamics and Developing Optimized Countermeasures for Rumor Spreading in Online Social Networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The spread of rumors in Online Social Networks (OSNs) poses great challenges to the social peace and public order. It is imperative to model propagation dynamics of rumors and develop corresponding countermeasures. Most of the existing works either overlook the heterogeneity of social networks or do not consider the cost of countermeasures. Motivated by these issues, this paper proposes a heterogeneous network based epidemic model that incorporates both the network heterogeneity and various countermeasures. Through analyzing the existence and stability of equilibrium solutions of the proposed ODE (Ordinary Differential Equation) system, the critical conditions that determine whether a rumor continuously propagates or becomes extinct are derived. Moreover, we concern about the cost of the main two types of countermeasures, i.e., Blocking rumors at influential users and spreading truth to clarify rumors. Employing the Pontryagin's maximum principle, we obtain the optimized countermeasures that ensures a rumor can become extinct at the end of an expected time period with lowest cost. Both the critical conditions and the optimized countermeasures provide a real-time decision reference to restrain the rumor spreading. Experiments based on Digg2009 dataset are conducted to evaluate the effectiveness of the proposed dynamic model and the efficiency of the optimized countermeasures.
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
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
Cited by
Systematic Literature Review on the Spread of Health-related Misinformation on Social Media
Wang, Y., McKee, M., Torbica, A., & Stuckler, D. (2019) · Social Science & Medicine · doi:10.1016/j.socscimed.2019.112552 · Cited by 1,806
“This has generated a series of studies of information diffusion (Serrano et al., 2015) , rumour spread (He et al., 2015) , and consequent behavioural changes (Salathé and Khandelwal, 2011; Wakamiya et al., 2016) .”
Attacks and countermeasures in the internet of vehicles
Sun, Y., Wu, L., Wu, S., Li, S., Zhang, T., Zhang, L., Xu, J., Xiong, Y., & Cui, X. (2017) · Annals of Telecommunications · doi:10.1007/s12243-016-0551-6 · Cited by 103
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
“s being sybils. Their evaluation, via simulations on Twitter data, show that the proposed approach significantly decreases the number of affected nodes, when compared to existing approaches. He et al. [82] argue that existing false information containment approaches have different costs and efficiencies in different OSN…”
Method
Metadata
- Authors
- He, Z., Cai, Z., & Wang, X.
- Venue
- 2015 IEEE 35th International Conference on Distributed Computing Systems
- Publisher
- IEEE
- Published
- 2015-06
- Pages
- 205-214
- OpenAlex
- W1552414050
- Cited by
- 111
- References
- 1
- FWCI
- 16.93
- 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
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.