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

• Published in: IEEE transactions on computational social systems Vol. 6; no. 5; pp. 956 - 967
• Main Authors: Du, Hongwei, Yuan, Caiwei, Yuan, He, Wei, Shanshan, Xu, Wen
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 01.10.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Approximation algorithms; Computer simulation; Dominating set (DS); Facebook; Greedy algorithms; influence diffusion; Simulation; social network; Social networks; Social problems; Time complexity; Wireless sensor networks
• ISSN: 2329-924X; 2329-924X; 2373-7476
• DOI: 10.1109/TCSS.2019.2937396

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.