General Rumor Blocking: An efficient random algorithm with martingale approach

Rumor Blocking, an important optimization problem in social network, has been extensively studied in the literature. Given social network \(G=(V,E)\) and rumor seed set A, the goal is asking for k protector seeds that protect the largest expected number of social individuals by truth. However, the source of rumor is always uncertain, rather than being predicted or being known in advance in the real situations, while rumor spreads like wildfire on the Internet.

[1]  Jaideep Srivastava,et al.  A Generalized Linear Threshold Model for Multiple Cascades , 2010, 2010 IEEE International Conference on Data Mining.

[2]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[3]  Devavrat Shah,et al.  Rumors in a Network: Who's the Culprit? , 2009, IEEE Transactions on Information Theory.

[4]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[5]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[6]  Deying Li,et al.  An efficient randomized algorithm for rumor blocking in online social networks , 2017, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[7]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[8]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[9]  Milind Tambe,et al.  Bayesian Security Games for Controlling Contagion , 2013, 2013 International Conference on Social Computing.

[10]  Evangelos Markakis,et al.  A Game-Theoretic Analysis of a Competitive Diffusion Process over Social Networks , 2012, WINE.

[11]  My T. Thai,et al.  Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks , 2016, SIGMOD Conference.

[12]  Roger Wattenhofer,et al.  Word of Mouth: Rumor Dissemination in Social Networks , 2008, SIROCCO.

[13]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[14]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

[15]  Noga Alon,et al.  Information Processing Letters a Note on Competitive Diffusion through Social Networks , 2022 .

[16]  Xiaokui Xiao,et al.  Influence maximization: near-optimal time complexity meets practical efficiency , 2014, SIGMOD Conference.

[17]  Milind Tambe,et al.  Security Games on Social Networks , 2012, AAAI Fall Symposium: Social Networks and Social Contagion.

[18]  Weili Wu,et al.  Precautionary rumor containment via trustworthy people in social networks , 2016, Discret. Math. Algorithms Appl..

[19]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[20]  David Williams,et al.  Probability with Martingales , 1991, Cambridge mathematical textbooks.

[21]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[22]  Mong-Li Lee,et al.  Targeted Influence Maximization in Social Networks , 2016, CIKM.

[23]  Chee Wei Tan,et al.  Rumor source detection with multiple observations: fundamental limits and algorithms , 2014, SIGMETRICS '14.

[24]  Weili Wu,et al.  Maximizing rumor containment in social networks with constrained time , 2014, Social Network Analysis and Mining.

[25]  Xiaokui Xiao,et al.  Influence Maximization in Near-Linear Time: A Martingale Approach , 2015, SIGMOD Conference.

[26]  Xiang Li,et al.  Limiting the Spread of Misinformation While Effectively Raising Awareness in Social Networks , 2015, CSoNet.