Online estimating the k central nodes of a network
暂无分享,去创建一个
Bruno Ribeiro | Don Towsley | Prithwish Basu | Yeon-sup Lim | Daniel S. Menasche | D. Towsley | Yeon-sup Lim | Bruno Ribeiro | P. Basu | D. Menasché
[1] Christos Faloutsos,et al. Graph evolution: Densification and shrinking diameters , 2006, TKDD.
[2] Donald F. Towsley,et al. Estimating and sampling graphs with multidimensional random walks , 2010, IMC '10.
[3] Tanya Y. Berger-Wolf,et al. Online Sampling of High Centrality Individuals in Social Networks , 2010, PAKDD.
[4] David A. Bader,et al. Approximating Betweenness Centrality , 2007, WAW.
[5] David Eppstein,et al. Fast approximation of centrality , 2000, SODA '01.
[6] Xiang-Yang Li,et al. Ranking of Closeness Centrality for Large-Scale Social Networks , 2008, FAW.
[7] Konstantin Avrachenkov,et al. Monte Carlo Methods in PageRank Computation: When One Iteration is Sufficient , 2007, SIAM J. Numer. Anal..
[8] Kathleen M. Carley,et al. On the robustness of centrality measures under conditions of imperfect data , 2006, Soc. Networks.
[9] Mark E. J. Newman. A measure of betweenness centrality based on random walks , 2005, Soc. Networks.
[10] Konstantin Avrachenkov,et al. Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation , 2010, ArXiv.
[11] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[12] Donald F. Towsley,et al. Improving Random Walk Estimation Accuracy with Uniform Restarts , 2010, WAW.
[13] Pietro Liò,et al. Fast centrality approximation in modular networks , 2009, CIKM-CNIKM.