Influence maximization on social networks: A study

Abstract

Influence Maximization, which selects a set of k users (called seed set) from a social network to maximize the expected number of influenced users (called influence spread), is a key algorithmic problem in social influence analysis. In this paper, we give recent studies on influence maximization algorithms. The main goal of this survey is to provide recent studies and future research opportunities. We give taxonomy of influence maximization algorithms with the comparative theoretical analysis. This paper provides a theoretical analysis of influence maximization problem based on algorithm design perspective and also provides the performance analysis of existing algorithms. © 2021 Bentham Science Publishers.