The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading *** problem finds many practic...
详细信息
The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading *** problem finds many practical applications in numerous areas such as information dissemination,epidemic immunity,and viral ***,most existing influence maximization algorithms are limited by the“rich-club”phenomenon and are thus unable to avoid the influence overlap of seed *** work proposes a novel adaptive algorithm based on a new gravity centrality and a recursive ranking strategy,named AIGCrank,to identify a set of influential ***,the gravity centrality jointly employs the neighborhood,network location and topological structure information of nodes to evaluate each node's potential of being selected as a *** also present a recursive ranking strategy for identifying seed nodes *** results show that our algorithm competes very favorably with the state-of-the-art algorithms in terms of influence propagation and coverage redundancy of the seed set.
暂无评论