Identifying influential spreaders by weighted LeaderRank
Identifying influential spreaders by weighted LeaderRank
复制标题
通过加权 LeaderRank 识别有影响力的传播者
DOI：
10.1016/j.physa.2014.02.041
复制
发表时间：
2014-06-15
影响因子：
3.3
通讯作者：
Chen, Duanbing
中科院分区：
文献类型：
--
作者：
Li, Qian;Zhou, Tao;Chen, Duanbing
识别有影响力的传播者对于理解和控制社交网络上的传播过程至关重要。通过将依赖于度的权重分配到与地面节点相关联的链接上，我们提出了一种名为LeaderRank的最近排名算法的变体（Lu等人，2011年）。在标准SIR模型上的仿真结果表明，加权LeaderRank算法在三个方面优于LeaderRank算法：（i）发现更有影响力的传播者的能力;（ii）对噪声数据有更高的容忍度;（iii）对故意攻击有更高的鲁棒性。(C)2014爱思唯尔有限公司版权所有。
Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank (Lu et al., 2011). According to the simulations on the standard SIR model, the weighted LeaderRank performs better than LeaderRank in three aspects: (i) the ability to find out more influential spreaders; (ii) the higher tolerance to noisy data; and (iii) the higher robustness to intentional attacks. (C) 2014 Elsevier B.V. All rights reserved.