Rumor spreading and monitoring deployment in online social networks

The rumor takes advantage of online social networks to spread and cause damage by abducting public's psychology and behaviors. Therefore, a novel SIDR rumor spreading model, which consider a “doubt” psychologic factor, is proposed to study the dynamic rules of rumor. To defense against rumors efficiently, a full coverage monitoring scheme based on theory of set cover problem is deployed through a greedy algorithm. The experiments show the way to control the rumor spreading. And the result shows the monitoring deployment achieves a full coverage efficiently.

[1]  Joseph Naor,et al.  Covering problems with hard capacities , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Zhong Kai-bin.  Crisis Management in China:the Challenge of the Transition , 2003 .

[3]  Yamir Moreno,et al.  Theory of Rumour Spreading in Complex Social Networks , 2007, ArXiv.

[4]  D. Zanette.  Dynamics of rumor propagation on small-world networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Yamir Moreno,et al.  Dynamics of rumor spreading in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Jing Ji-peng,et al.  Research on the Social Network-based Mechanism of Public Crisis Information Communication , 2007 .

[7]  Wenting Huang,et al.  Effective deployment of monitoring points on social networks , 2015, 2015 International Conference on Computing, Networking and Communications (ICNC).

[8]  D. Kendall,et al.  Epidemics and Rumours , 1964, Nature.

[9]  Le Zhang,et al.  Two-stage dynamics of crisis information dissemination on social network , 2009, 2009 International Conference on Management Science and Engineering.

[10]  Jiajia Wang,et al.  Rumor spreading model considering forgetting and remembering mechanisms in inhomogeneous networks , 2013 .

[11]  Hong Wen,et al.  Rumor Spreading and Security Monitoring in Complex Networks , 2015, CSoNet.

[12]  Rosane Minghim,et al.  Toward understanding how users respond to rumours in social media , 2016, 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  Takuro Fukunaga.  Covering problems in edge- and node-weighted graphs , 2016, Discret. Optim..