As Online Social Networks have become the integral part of our lives, the pros and cons of using them have been reflected in the society. On one hand, these online networks are the easiest ways to connect with your peers, communities and good for social and professional collaborations; on the other hand, they are the most vulnerable means of spreading rumors, threats and gossips within no time. There are several information diffusion algorithms using which the rumors can be shared on these mediums. The ways companies target and increase their customer base and sales using these diffusion algorithms, similarly rumors and gossips among the communities can also be shared. Some algorithms are deterministic and some are stochastic in nature. In this paper, we have reviewed the methods for spreading and blocking the rumors and compared them in the context of dynamic social networks. We have categorized the approaches on the basis of various measures and analysed their behavioural differences. The impact of several social parameters have also been studied to find the factors which are preferable to block the rumors.

Social Networks, Information Diffusion, Rumor Blocking, Dynamic Graphs, Anti-rumors

[1] Harris, Lisa, and Alan Rae. "Social networks: the future of marketing for small business." Journal of business strategy 2009.
[2] Watts, Duncan J. "The “new” science of networks." Annu. Rev. Sociol. 30 (2004): 243-270.
[3] Verbeke, Wouter, David Martens, and Bart Baesens. "Social network analysis for customer churn prediction." Applied Soft Computing 14 (2014): 431-446.
[4] Centola, Damon. "The spread of behavior in an online social network experiment." science 329, no. 5996 (2010): 1194-1197.
[5] Ghosh, Rumi, and Kristina Lerman. "Predicting influential users in online social networks." arXiv preprint arXiv:1005.4882 (2010).
[6] Bargar, Alicia, Stephanie Pitts, Janis Butkevics, and Ian McCulloh. "Challenges and Opportunities to Counter Information Operations Through Social Network Analysis and Theory." In 2019 11th International Conference on Cyber Conflict (CyCon), vol. 900, pp. 1-18. IEEE, 2019.
[7] Ohara, Kouzou, Kazumi Saito, Masahiro Kimura, and Hiroshi Motoda. "Critical Node Identification based on Articulation Point Detection for Uncertain Network." International Journal of Networking and Computing 9, no. 2 (2019): 201-216.
[8] Yan, Ruidong, Yi Li, Weili Wu, Deying Li, and Yongcai Wang. "Rumor blocking through online link deletion on social networks." ACM Transactions on Knowledge Discovery from Data (TKDD) 13, no. 2 (2019): 1-26.
[9] Zhao, Yuxin, Shenghong Li, and Feng Jin. "Identification of influential nodes in social networks with community structure based on label propagation." Neurocomputing 210 (2016): 34-44.
[10] Ma, Ling-ling, Chuang Ma, Hai-Feng Zhang, and Bing-Hong Wang. "Identifying influential spreaders in complex networks based on gravity formula." Physica A: Statistical Mechanics and its Applications 451 (2016): 205-212.
[11] Zubiaga, Arkaitz, Ahmet Aker, Kalina Bontcheva, Maria Liakata, and Rob Procter. "Detection and resolution of rumours in social media: A survey." ACM Computing Surveys (CSUR) 51, no. 2 (2018): 1-36.
[12] Robert H. Knapp. "A psychology of rumor. " Public Opin. Q. 8, 1 (1944), 22–37.
[13] Zubiaga, Arkaitz, Maria Liakata, Rob Procter, Geraldine Wong Sak Hoi, and Peter Tolmie. "Analysing how people orient to and spread rumours in social media by looking at conversational threads." PloS one 11, no. 3 (2016).
[14] Domingos, Pedro, and Matt Richardson. "Mining the network value of customers." In Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 57-66. 2001.
[15] Kempe, David, Jon Kleinberg, and Éva 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. 2003.
[16] Dekker, A.H., 2008. "Centrality in social networks: Theoretical and simulation approaches." Proceedings of SimTecT (2008), pp.12-15.
[17] Bonacich, Phillip. "Power and centrality: A family of measures." American journal of sociology 92, no. 5 (1987): 1170-1182.
[18] Kaur, Harneet, and Jing He. "Blocking negative influential node set in social networks: from host perspective." Transactions on Emerging Telecommunications Technologies 28, no. 4 (2017): e3007.
[19] Arazkhani, Niloofar, Mohammad Reza Meybodi, and Alireza Rezvanian. "Influence Blocking Maximization in Social Network Using Centrality Measures." In 2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI), pp. 492-497. IEEE, 2019.
[20] Budak, Ceren, Divyakant Agrawal, and Amr El Abbadi. "Limiting the spread of misinformation in social networks." In Proceedings of the 20th international conference on World wide web, pp. 665-674. ACM, 2011.
[21] Tong, Guangmo, Weili Wu, Ling Guo, Deying Li, Cong Liu, Bin Liu, and Ding-Zhu Du. "An efficient randomized algorithm for rumor blocking in online social networks." IEEE Transactions on Network Science and Engineering (2017).
[22] Dey, Paramita, and Sarbani Roy. "Centrality based information blocking and influence minimization in online social network." In 2017 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), pp. 1-6. IEEE, 2017.
[23] M. Kimura, K. Saito, and H. Motoda, “Minimizing the spread of contamination by blocking links in a network.” in AAAI, vol. 8, 2008, pp. 1175–1180.
[24] E. B. Khalil, B. Dilkina, and L. Song, “Scalable diffusion-aware optimization of network topology,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 2014, pp. 1226–1235.
[25] H. Tong, B. A. Prakash, T. Eliassi-Rad, M. Faloutsos, and C. Faloutsos, “Gelling, and melting, large graphs by edge manipulation,” in Proceedings of the 21st ACM international conference on Information and knowledge management. ACM, 2012, pp. 245–254.
[26] Kuhlman, Chris J., Gaurav Tuli, Samarth Swarup, Madhav V. Marathe, and S. S. Ravi. "Blocking simple and complex contagion by edge removal." In 2013 IEEE 13th International Conference on Data Mining, pp. 399-408. IEEE, 2013.
[27] Yao, Qipeng, Chuan Zhou, Linbo Xiang, Yanan Cao, and Li Guo. "Minimizing the negative influence by blocking links in social networks." In International conference on trustworthy computing and services, pp. 65-73. Springer, Berlin, Heidelberg, 2014.
[28] He, Jing, Hongyu Liang, and Hao Yuan. "Controlling infection by blocking nodes and links simultaneously." In International workshop on internet and network economics, pp. 206-217. Springer, Berlin, Heidelberg, 2011.
[29] S. Wang, X. Zhao, Y. Chen, Z. Li, K. Zhang, and J. Xia, “Negative influence minimizing by blocking nodes in social networks.” In AAAI (Late-Breaking Developments), 2013, pp. 134–136.
[30] Tong, Guangmo, Weili Wu, Shaojie Tang, and Ding-Zhu Du. "Adaptive influence maximization in dynamic social networks." IEEE/ACM Transactions on Networking (TON) 25, no. 1 (2017): 112-125.
[31] Tripathy, R.M., Bagchi, A. and Mehta, S., 2010, October. "A study of rumor control strategies on social networks." In Proceedings of the 19th ACM international conference on Information and knowledge management (pp. 1817-1820).
[32] Tripathy, R.M., Bagchi, A. and Mehta, S., 2013. "Towards combating rumors in social networks: Models and metrics." Intelligent Data Analysis, 17(1), pp.149-175.
[33] L. Fan, Z. Lu, W. Wu, B. Thuraisingham, H. Ma, and Y. Bi, "Least cost rumor blocking in social networks," in Distributed Computing Systems (ICDCS), 2013 IEEE 33rd International Conference on. IEEE, 2013, pp. 540–549.
[34] Nguyen, N.P., Yan, G., Thai, M.T. and Eidenbenz, S., 2012, June. "Containment of misinformation spread in online social networks." In Proceedings of the 4th Annual ACM Web Science Conference (pp. 213-222).
[35] Santhoshkumar, S. and Babu, L.D., 2019. "An Effective Rumor Control Approach for Online Social Networks." In Information Systems Design and Intelligent Applications (pp. 63-73). Springer, Singapore.