Influence Maximization Algorithms Research Based on Big Graphs

Abstract

Unlike the traditional methods, such as the Independent Cascade Model and Liner Threshold Model. In this paper, we propose a kind of new Degree-priority heuristic IM algorithm in a big graph. We prove this algorithm. We do some experiments and make some comaparision between the Degree-priority heuristic IM algorithm and traditional IM algorithm.