General rumor blocking: an efficient random algorithm with martingale approach
DOI10.1016/J.TCS.2019.05.044zbMATH Open1436.91095OpenAlexW2954703284WikidataQ127575552 ScholiaQ127575552MaRDI QIDQ2283009FDOQ2283009
Authors: Qizhi Fang, Xin Chen, Qingqin Nong, Zongchao Zhang, Yongchang Cao, Yan Feng, Tao Sun, Suning Gong, Du Ding-Zhu 
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.044
Recommendations
- Community-based rumor blocking maximization in social networks: algorithms and analysis
- Centralized and decentralized rumor blocking problems
- Community-based rumor blocking maximization in social networks
- Minimizing the Spread of Rumor Within Budget Constraint in Online Network
- Blocking rumor by cut
Martingales with discrete parameter (60G42) Randomized algorithms (68W20) Social networks; opinion dynamics (91D30)
Cites Work
- Probability with Martingales
- Concentration Inequalities and Martingale Inequalities: A Survey
- A note on competitive diffusion through social networks
- An analysis of approximations for maximizing submodular set functions—I
- Rumors in a Network: Who's the Culprit?
- Word of Mouth: Rumor Dissemination in Social Networks
- Precautionary rumor containment via trustworthy people in social networks
- Maximizing Social Influence in Nearly Optimal Time
Cited In (3)
This page was built for publication: General rumor blocking: an efficient random algorithm with martingale approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283009)
