Identify Initial Nodes for Spreader in A New Diffusion Model Based on Topology (DBT) in Social Networks

Abstract

With the development of science and technology through social networks, the process of diffusion has become a controversial subject. In social networks, the process of diffusion is transmitted from one individual to another. The influence maximization problem, in which at least k nodes are chosen as the initial nodes of the spreader in the smallest amount of time, is one of the most critical aspects of the diffusion process. Furthermore, the initial nodes in the social network should generate the most influence on the other nodes in the network. However, in the algorithms proposed to solve the problem of influence maximization, the real-world factors which affect the influence probability in diffusion models are ignored for example, the influence probability is determined randomly. This problem causes influence maximization algorithms based on diffusion models to face the challenge of time-consuming Monte Carlo simulation. So, the RIM algorithm presented in this article which this method selects the initial nodes of the spreader according on their local reachability. In addition, Due to privacy in social networks, complete information about people such as gender, education, etc. is not available. For this reason, in the RIM algorithm, using the graph structure in social networks, the influence probability is calculated in the new DBT diffusion model. In addition, the RIM algorithm exhibits stable performance in the selection of the spreader's initial nodes in terms of influence spread, and execution time.