Misinformation Mitigation under Differential Propagation Rates and Temporal Penalties
Michael Simpson, Laks V. S. Lakshmanan, Farnoosh Hashemi
Abstract
We propose an information propagation model that captures important temporal aspects that have been well observed in the dynamics of fake news diffusion, in contrast with the diffusion of truth. The model accounts for differential propagation rates of truth and misinformation and for user reaction times. We study a time-sensitive variant of the misinformation mitigation problem, where k seeds are to be selected to activate a truth campaign so as to minimize the number of users that adopt misinformation propagating through a social network. We show that the resulting objective is non-submodular and employ a sandwiching technique by defining submodular upper and lower bounding functions, providing data-dependent guarantees. In order to enable the use of a reverse sampling framework, we introduce a weighted version of reverse reachability sets that captures the associated differential propagation rates and establish a key equivalence between weighted set coverage probabilities and mitigation with respect to the sandwiching functions. Further, we propose an offline reverse sampling framework that provides (1 - 1/ e
- ϵ)-approximate solutions to our bounding functions and introduce an importance sampling technique to reduce the sample complexity of our solution. Finally, we show how our framework can provide an anytime solution to the problem. Experiments over five datasets show that our approach outperforms previous approaches and is robust to uncertainty in the model parameters.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0d5a3581-8c87-4ba6-a5eb-8daae60e551bCited by top-tier papers5
- CAT-Walk: Inductive Hypergraph Learning via Set WalksAli Behrouz, Farnoosh Hashemi, Sadaf Sadeghian, Margo I. SeltzerNeurIPS 2023 · 21 citations
- Efficient Influence Minimization via Node BlockingJinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang et al.VLDB 2024 · 18 citations
- Host Profit Maximization: Leveraging Performance Incentives and User FlexibilityXueqin Chang, Xiangyu Ke, Lu Chen, Congcong Ge et al.VLDB 2024 · 4 citations
- Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid ConstraintYiqian Huang, Shiqi Zhang, Laks V. S. Lakshmanan, Wenqing Lin et al.VLDB 2025 · 1 citation
- Hyperparametric Robust and Dynamic Influence MaximizationArkaprava Saha, Bogdan Cautis, Xiaokui Xiao, Laks V. S. LakshmananAAAI 2025 · 1 citation
Builds on1
Related papers
- Augmenting Social Influence of Uncertain Seeds via Probabilistic Link InsertionXiaolong Chen, Jing TangVLDB 2026
- Time-Critical Influence Minimization via Node BlockingJinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang et al.SIGMOD 2026 · 1 citation
- Minimizing the Influence of Misinformation via Vertex BlockingJiadong Xie, Fan Zhang, Kai Wang, Xuemin Lin et al.ICDE 2023 · 20 citations
- Co-exposure Maximization in Online Social NetworksSijing Tu, Çigdem Aslay, Aristides GionisNeurIPS 2020 · 19 citations
- Voting-based Opinion MaximizationArkaprava Saha, Xiangyu Ke, Arijit Khan, Laks V. S. LakshmananICDE 2023 · 7 citations
