A fast algorithm for finding most influential people based on the linear threshold model

作者：

Highlights：

• A new algorithm, named ComPath, is proposed based on the linear threshold model.

• We make use of structural communities of the input network.

• Experimental evaluations are carried out by use of NetHEPT and Epinion datasets.

• ComPath is faster and more efficient than the state of the art algorithms.

摘要

•A new algorithm, named ComPath, is proposed based on the linear threshold model.•We make use of structural communities of the input network.•Experimental evaluations are carried out by use of NetHEPT and Epinion datasets.•ComPath is faster and more efficient than the state of the art algorithms.

论文关键词：Social networks,Influential people retrieval,Influence maximization,Linear threshold model

论文评审过程：Available online 30 September 2014.

论文官网地址：https://doi.org/10.1016/j.eswa.2014.09.037