Abstract

Identification of the most influential spreaders that maximize information propagation in social networks is a classic optimization problem, called the influence maximization (IM) problem. A reasonable diffusion model that can accurately simulate information propagation in social networks is the key step to efficiently solving the IM problem. Synergism of neighbor nodes plays an important role in information propagation dynamics. Some known diffusion models have considered the reinforcement mechanism in defining the activation threshold. Most of these models focus on the synergetic effects of nodes on their common neighbors, but the accumulation of synergism has been neglected in previous studies. Inspired by these facts, we first discuss the catalytic role of synergism in the spreading dynamics of social networks and then propose a novel diffusion model called the synergism-based three-step cascade model (TSSCM) based on the above analysis and the three-degree influence theory. Finally, we devise an algorithm for solving the IM problem based on the TSSCM. Experiments on five real large-scale social networks demonstrate the efficacy of our method, which achieves competitive results in terms of influence spreading compared to the four other algorithms tested.

Highlights

  • The problem of finding the optimal set of influencers, whereby viruses, information, and epidemics propagate through network edges via interactions between individual constituents, has broad applications in a variety of network dynamics areas [1,2,3,4,5,6,7,8]

  • The evaluation indicators we adopt for the influence maximization (IM) algorithms are as follows: (a) the spreading influence of the seed set for three-step cascade model (TSSCM), (b) the spreading influence of the seed set for independent cascade model (ICM), and (c) the computational time required by the IM algorithm to find the seed set

  • We have shown that the IM problem under TSSCM is NP hard; we run 10000 Monte Carlo simulations to obtain the results

Read more

Summary

Introduction

The problem of finding the optimal set of influencers, whereby viruses, information, and epidemics propagate through network edges via interactions between individual constituents, has broad applications in a variety of network dynamics areas [1,2,3,4,5,6,7,8]. Flaviano and Hernan A [31] mapped the information spread on social networks onto an optimal percolation and presented an algorithm, called collective influence (CI), based on the weak connection between nodes to identify the minimal set of influencers. In this paper, we first discuss the catalytic role of synergism on the spreading dynamics in social networks and propose a novel diffusion model called the synergism-based three-step cascade model (TSSCM) based on the above analysis and three-degree influence theory [35]. TSSCM accumulates synergism, i.e., active neighbors of an active node cooperate to spread information This phenomenon is common in real social systems, such as microblogging retweeting [44], opinion propagation [30], and animal invasion [46]. Sorting CI_TSL(i) requires O (NlogN), and we select nodes until the seed set includes k nodes; the total computational complexity of our algorithm is O(kNlogN), which ensures that our algorithm is scalable to large networks

Experiments
Evaluation methodologies
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call