Identify Connected Positive Influence Dominating Set in Social Networks Using Two-Hop Coverage

Online social networks (OSNs) have become effective platforms for influence diffusion. Finding a positive influence dominating set (PIDS) in OSNs can be used to help mitigate social problems such as adolescent drinking and smoking. A set is positive influence dominating if each node in the network is either in the set or has half neighbors in the set. In this article, we propose an efficient greedy algorithm to identify connected PIDS (CPIDS) in large-scale social networks, which utilize two hop coverage information of nodes in the network. Our simulation results show that the proposed approach outperforms existing algorithms in real-world large-scale networks in terms of time cost. Our approach can be potentially used in designing efficient influence diffusion algorithms in OSNs.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[3]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[4]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Jun Li,et al.  A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks , 2015, Theor. Comput. Sci..

[6]  Mohammad Reza Meybodi,et al.  Finding minimum weight connected dominating set in stochastic graph based on learning automata , 2012, Inf. Sci..

[7]  Nasser Yazdani,et al.  A New Algorithm for Positive Influence Dominating Set in Social Networks , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[8]  Subhashis Majumder,et al.  Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set , 2014, ICAA.

[9]  Chris Reade,et al.  Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information , 2017, Comput. Networks.

[10]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[12]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[13]  Shlomo Havlin,et al.  Conditions for viral influence spreading through multiplex correlated social networks , 2014, 1404.3114.

[14]  Tatsuya Akutsu,et al.  Analysis on critical nodes in controlling complex networks using dominating sets , 2013, 2013 International Conference on Signal-Image Technology & Internet-Based Systems.

[15]  Weili Wu,et al.  Positive influence dominating sets in power-law graphs , 2011, Social Network Analysis and Mining.

[16]  My T. Thai,et al.  On the approximability of positive influence dominating set in social networks , 2014, J. Comb. Optim..

[17]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[18]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[19]  Samir Khuller,et al.  Revisiting Connected Dominating Sets: An Almost Optimal Local Information Algorithm , 2019, Algorithmica.

[20]  Margaret B. Cozzens,et al.  Dominating sets in social network graphs , 1988 .

[21]  Adam J. Smith,et al.  The Database of Interacting Proteins: 2004 update , 2004, Nucleic Acids Res..

[22]  Kuai Xu,et al.  Positive Influence Dominating Set in Online Social Networks , 2009, COCOA.

[23]  Zhao Zhang,et al.  Approximation algorithm for partial positive influence problem in social network , 2017, J. Comb. Optim..

[24]  Mohammad Reza Meybodi,et al.  Minimum positive influence dominating set and its application in influence maximization: a learning automata approach , 2018, Applied Intelligence.

[25]  Ivan Stojmenovic,et al.  Wireless Sensor and Actuator Networks: Algorithms and Protocols for Scalable Coordination and Data Communication , 2010 .

[26]  Ji Zhang,et al.  A Self-Stabilizing Algorithm for Finding a Minimal Positive Influence Dominating Set in Social Networks , 2013, ADC.

[27]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Tatsuya Akutsu,et al.  Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control , 2012 .

[29]  Hongwei Du,et al.  Blocking Rumor by Cut , 2018, J. Comb. Optim..

[30]  Shaojie Tang,et al.  A Novel Approximation for Multi-Hop Connected Clustering Problem in Wireless Networks , 2017, IEEE/ACM Transactions on Networking.

[31]  Johann Hurink,et al.  A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs , 2005, WAOA.

[32]  Yangyang Zhang,et al.  High-precision shortest distance estimation for large-scale social networks , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[33]  Weili Wu,et al.  On general threshold and general cascade models of social influence , 2018, J. Comb. Optim..

[34]  Tao Li,et al.  Multi-Document Summarization via the Minimum Dominating Set , 2010, COLING.

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

[36]  Ioannis Xenarios,et al.  DIP: The Database of Interacting Proteins: 2001 update , 2001, Nucleic Acids Res..

[37]  Stephen P. Borgatti,et al.  Identifying sets of key players in a social network , 2006, Comput. Math. Organ. Theory.

[38]  Faisal N. Abu-Khzam,et al.  Efficient heuristic algorithms for positive-influence dominating set in social networks , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[39]  Yan Shi,et al.  On positive influence dominating sets in social networks , 2011, Theor. Comput. Sci..