Abstract
Either in real world social society or online social networks, rumor blocking is an important issue. Rumor sources spread negative information throughout the network, which may cause unbelievable results in real society, such as panic, unrest. Propagating positive information from several “protector” users is an effective method for rumor blocking once the rumor is detected. In this paper, we assume that user will not be influenced if they receive the positive information ahead of negative one. According to data analysis of user’s activity, network manager may not know the exact positions of rumor but the probability of each user being a rumor, “protector” nodes need to be selected in order to prepare for rumor blocking. Given a social network \(G=(V,E,P,Q)\), where P is the weight function on edge set E, \(P_{(u,v)}\) is the probability that v is activated by u after u is activated, and Q is the weight function on node set V, \(Q_v\) is the probability that v will be a rumor source. Stochastic Rumor Blocking (SRB) problem is to select k nodes as “protectors” such that the expected influence of rumors on users is minimized eventually. SRB will be proved to be NP-hard and the objective function is supermodular. We present a Compound Reverse Influence Set (CRIS) sampling method for estimation of the objective value which can be represented as a compound set function. Based on CRIS, a randomized greedy algorithm with theoretical analysis will be presented.
This work was supported in part by the National Natural Science Foundation of China under Grant No. 72074203 and the Fundamental Research Funds for the Central Universities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aslay, C., Lakshmanan, L.V., Lu, W., Xiao, X.: Influence maximization in online social networks. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 775–776. ACM (2018)
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77105-0_31
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. SIAM (2014)
Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 665–674. ACM (2011)
Burkitt, L.: Fearing radiation, Chinese rush to buy table salt. The Wall Street Journal (2011)
Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795–804. ACM (2016)
Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte carlo estimation. SIAM J. Comput. 29(5), 1484–1496 (2000)
Du, N., Liang, Y., Balcan, M.F., Gomez-Rodriguez, M., Zha, H., Song, L.: Scalable influence maximization for multiple products in continuous-time diffusion networks. J. Mach. Learn. Res. 18(2), 1–45 (2017)
Fang, Q., et al.: General rumor blocking: an efficient random algorithm with martingale approach. Theoret. Comput. Sci. 803, 82–93 (2020)
Garimella, K., Gionis, A., Parotsidis, N., Tatti, N.: Balancing information exposure in social networks (2017)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM (2003)
Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans. Knowl. Dis. Data (TKDD) 3(2), 9 (2009)
Li, S., Zhu, Y., Li, D., Kim, D., Huang, H.: Rumor restriction in online social networks. In: 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC), pp. 1–10. IEEE (2013)
Lowalekar, M., Varakantham, P., Kumar, A.: Robust influence maximization. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 1395–1396. International Foundation for Autonomous Agents and Multiagent Systems (2016)
Morozov, E.: Swine flu: Twitters power to misinform. Foreign policy (2009)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-I. Math. Program. 14(1), 265–294 (1978)
Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695–710. ACM (2016)
Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J. Sel. Areas Commun. 31(6), 1084–1094 (2013)
Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K.I.: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: AAAI, pp. 138–144 (2014)
Ping, Y., Cao, Z., Zhu, H.: Sybil-aware least cost rumor blocking in social networks. In: 2014 IEEE Global Communications Conference (GLOBECOM), pp. 692–697. IEEE (2014)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539–1554. ACM (2015)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 75–86. ACM (2014)
Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Netw. Sci. Eng. (2017)
Tsai, J., Nguyen, T.H., Tambe, M.: Security games for controlling contagion. In: AAAI (2012)
Wang, B., Chen, G., Fu, L., Song, L., Wang, X., Liu, X.: Drimux: dynamic rumor influence minimization with user experience in social networks. In: AAAI, vol. 16, pp. 791–797 (2016)
Yang, Y., Lu, Z., Li, V.O., Xu, K.: Noncooperative information diffusion in online social networks under the independent cascade model. IEEE Trans. Comput. Soc. Syst. 4(3), 150–162 (2017)
Zhang, H., Zhang, H., Li, X., Thai, M.T.: Limiting the spread of misinformation while effectively raising awareness in social networks. In: Thai, M.T., Nguyen, N.P., Shen, H. (eds.) CSoNet 2015. LNCS, vol. 9197, pp. 35–47. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21786-4_4
Zhu, J., Ghosh, S., Wu, W.: Group influence maximization problem in social networks. IEEE Trans. Comput. Soc. Syst. PP(99), 1–9 (2019)
Zhu, J., Ghosh, S., Wu, W.: Robust rumor blocking problem with uncertain rumor sources in social networks. World Wide Web (1), 24 (2021)
Zhu, J., Ni, P., Tong, G., Wang, G., Huang, J.: Influence maximization problem with echo chamber effect in social network. IEEE Trans. Comput. Soc. Syst. PP(99), 1–9 (2021)
Zhu, J., Zhu, J., Ghosh, S., Wu, W., Yuan, J.: Social influence maximization in hypergraph in social networks. IEEE Trans. Netw. Sci. Eng., 1–1 (2018). https://doi.org/10.1109/TNSE.2018.2873759
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Zhu, J., Li, R., Ghosh, S., Wu, W. (2024). Stochastic Model for Rumor Blocking Problem in Social Networks Under Rumor Source Uncertainty. In: Wu, W., Tong, G. (eds) Computing and Combinatorics. COCOON 2023. Lecture Notes in Computer Science, vol 14423. Springer, Cham. https://doi.org/10.1007/978-3-031-49193-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-031-49193-1_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49192-4
Online ISBN: 978-3-031-49193-1
eBook Packages: Computer ScienceComputer Science (R0)