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

Abstract

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.