摘要: Centrality measures such as the degree, k-shell, or eigenvalue centrality can identify a network's most influential nodes, but are rarely usefully accurate in quantifying the spreading …
nature.com
harvard.edu
core.ac.uk
mpg.de
sci-hub.st 参考文章(53)
Nikolaos Fountoulakis, Thomas Sauerwald, Konstantinos Panagiotou, Ultra-fast rumor spreading in social networks symposium on discrete algorithms. pp. 1642- 1660 ,(2012) , 10.5555/2095116.2095246
Tamás Nepusz, Gábor Csárdi, The igraph software package for complex network research InterJournal Complex Systems. ,vol. 1695, ,(2006)
Matthew Richardson, Rakesh Agrawal, Pedro Domingos, Trust management for the semantic web international semantic web conference. pp. 351- 368 ,(2003) , 10.1007/978-3-540-39718-2_23
Matheus P. Viana, João L. B. Batista, Luciano da F. Costa, Effective number of accessed nodes in complex networks. Physical Review E. ,vol. 85, pp. 036105- ,(2012) , 10.1103/PHYSREVE.85.036105
Hamed Haddadi, Fabr´ıcio Benevenuto, Krishna P. Gummadi, Meeyoung Cha, Measuring User Influence in Twitter: The Million Follower Fallacy international conference on weblogs and social media. pp. 10- 17 ,(2010)
Michele Benzi, Christine Klymko, A matrix analysis of different centrality measures. arXiv: Numerical Analysis. ,(2013)
S.-W. Son, C. Christensen, P. Grassberger, M. Paczuski, PageRank and rank-reversal dependence on the damping factor. Physical Review E. ,vol. 86, pp. 066104- ,(2012) , 10.1103/PHYSREVE.86.066104
B.A.N. Travençolo, L. da F. Costa, Accessibility in complex networks Physics Letters A. ,vol. 373, pp. 89- 95 ,(2008) , 10.1016/J.PHYSLETA.2008.10.069
Elizabeth Costenbader, Thomas W Valente, The stability of centrality measures when networks are sampled Social Networks. ,vol. 25, pp. 283- 307 ,(2003) , 10.1016/S0378-8733(03)00012-1
Víctor M. Eguíluz, Konstantin Klemm, Konstantin Klemm, M. Ángeles Serrano, Maxi San Miguel, A measure of individual role in collective dynamics Scientific Reports. ,vol. 2, pp. 292- 292 ,(2012) , 10.1038/SREP00292