Li, Qian Zhou, Tao Lü, Linyuan Chen, Duanbing 2014-06-15 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 (Lü 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. application/pdf https://folia.unifr.ch/global/documents/303821 https://folia.unifr.ch/documents/303821/files/lu_iis.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.physa.2014.02.041 info:eu-repo/semantics/openAccess License undefined Physica A: Statistical Mechanics and its Applications. - 2014, vol. 404, p. 47–55 Social networks Influential spreader LeaderRank Random walk info:eu-repo/classification/udc/53 Identifying influential spreaders by weighted LeaderRank http://purl.org/coar/resource_type/c_6501