Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period

DOI10.1016/j.tcs.2024.114898MaRDI QIDQ6652431

Jianming Zhu, Priyanshi Garg, Ye Xing, Weili Wu, Smita Ghosh, Runzhi Li

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

uncertaintysocial networksstochasticrumor blockingcompound reverse influence set sampling

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• Minimizing rumor influence in multiplex online social networks based on human individual and social behaviors
• General rumor blocking: an efficient random algorithm with martingale approach
• Submodular functions and optimization.
• The structure of scientific collaboration networks
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• An Optimal Algorithm for Monte Carlo Estimation
• Maximizing Social Influence in Nearly Optimal Time

This page was built for publication: Efficient algorithm for stochastic rumor blocking problem in social networks during safety accident period

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652431)