Rumor Containment by Spreading Correct Information in Social Networks

Rumors can propagate at great speed through social networks and produce significant damages. In order to control rumor propagation, spreading correct information to counterbalance the effect of the rumor seems more appropriate than simply blocking rumors by censorship or network disruption. In this paper, a competitive diffusion model, namely Linear Threshold model with One Direction state Transition (LT1DT), is proposed for modeling competitive information propagation of two different types in the same network. Unlike other competitive diffusion models in which individual beliefs do not change once adopted, LT1DT can model the behavior of a person that, although initially influenced by the rumor, can change his/her mind when receiving correct information. The problem of minimizing rumor spread in social networks is explored. Several simulations on two real-world datasets using four heuristic approaches are presented.

[1]  Alessandro Giua,et al.  Influence minimization in linear threshold networks , 2019, Autom..

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

[3]  Alexey S. Matveev,et al.  Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization , 2015, IEEE Transactions on Automatic Control.

[4]  Xiaodong Liu,et al.  IMGPU: GPU-Accelerated Influence Maximization in Large-Scale Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[5]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[6]  Roberto Tempo,et al.  The PageRank Problem, Multiagent Consensus, and Web Aggregation: A Systems and Control Viewpoint , 2013, IEEE Control Systems.

[7]  Francesco Bullo,et al.  Modeling and analysis of competitive propagation with social conversion , 2014, 53rd IEEE Conference on Decision and Control.

[8]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.

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

[10]  A. Giua,et al.  On the Spread of Innovation in Social Networks , 2013 .

[11]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[12]  Emma K. Macdonald,et al.  Brand Awareness Effects on Consumer Decision Making for a Common, Repeat Purchase Product:: A Replication , 2000 .

[13]  Wanlei Zhou,et al.  To Shut Them Up or to Clarify: Restraining the Spread of Rumors in Online Social Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

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

[15]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[16]  R. Srikant,et al.  Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate , 2014, Autom..

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

[18]  Zhiwu Li,et al.  Minimizing the Influence Propagation in Social Networks for Linear Threshold Models , 2017 .

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

[20]  Asuman E. Ozdaglar,et al.  Diffusion of innovations in social networks , 2011, IEEE Conference on Decision and Control and European Control Conference.