Identify multiple seeds for influence maximization by statistical physics approach and multi-hop coverage

Abstract

Abstract Finding the influential vertexes as seeds in a real network is an important problem which relates to wide applications. However, some conventional heuristic methods do not consider the overlap phenomenon. In order to avoid the overlap of spreading, we propose a new method in combing the statistical physics approach and multi-hop coverage. We also propose a faster epidemic model which does not need the averaging of stochastic behavior. Through the computer simulation, the obtained results show that our method can outperforms other conventional methods in the meaning of stronger spreading power per seed.

Keywords

• Influence maximum problem
• Multiple seeds
• Vertex cover problem
• L-hop coverage
• Overlapping phenomena
• SIR model