Online estimating the κ central nodes of a network

Proceedings of the 2011 IEEE 1st International Network Science Workshop, NSW 2011

Volumn , Issue , 2011, Pages 118-122

  Lim, Yeon Sup ^a   Menasche, Daniel S ^a   Ribeiro, Bruno ^a   Towsley, Don ^a   Basu, Prithwish ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b RAYTHEON COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM WALK; SUBGRAPHS;

EID: 80053203334     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NSW.2011.6004633     Document Type: Conference Paper

References (18)

1. Wikipedia, "Centrality-Wikipedia, the free encyclopedia," [Online; accessed 8-May-2011].
2. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graph evolution: Densification and shrinking diameters," ACM KDD, vol. 1, March 2007.
3. Network Data, http://www-personal.umich.edu/mejn/netdata/.
4. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations," in ACM SIGKDD. New York, NY, USA: ACM, 2005, pp. 177-187. (Pubitemid 43218279)
5. M. J. Newman, "A measure of betweenness centrality based on random walks," Social Networks, vol. 27, no. 1, pp. 39-54, 2005.
6. Wikipedia, "Spearman's rank correlation coefficient-Wikipedia, the free encyclopedia," [Online; accessed 8-May-2011].
7. -, "Skewness-Wikipedia, the free encyclopedia," [Online; accessed 8-May-2011].
8. K. Avrachenkov, B. F. Ribeiro, and D. F. Towsley, "Improving random walk estimation accuracy with uniform restarts," in WAW'10, 2010.
9. B. Ribeiro and D. Towsley, "Estimating and sampling graphs with multidimensional random walks," in IMC. ACM, 2010, pp. 390-403.
10. A. S. Maiya and T. Y. Berger-Wolf, "Online sampling of high centrality individuals in social networks," in PAKDD'10, 2010.
11. Y. sup Lim, D. S. Menasche, B. Ribeiro, D. Towsley, and P. Basu, "Online estimation of top k nodes of a network," in Technical Report, 2011. [Online]. Available: http://gaia.cs.umass.edu/networks/papers/nsw-2011.pdf
12. D. Bader, S. Kintali, K. Madduri, and M. Mihail, "Approximating betweenness centrality," in Algorithms and Models for the Web-Graph. Springer Berlin, 2007, vol. 4863, pp. 124-137.
13. D. Eppstein and J. Wang, "Fast approximation of centrality," in SODA, Philadelphia, PA, USA, 2001, pp. 228-229.
14. S. Y. Chan, I. X. Leung, and P. Lìo, "Fast centrality approximation in modular networks," in ACM workshop complex networks, 2009.
15. K. Okamoto, W. Chen, and X.-Y. Li, "Ranking of closeness centrality for large-scale social networks," in FAW'08, 2008.
16. S. P. Borgatti, K. M. Carley, and D. Krackhardt, "On the robustness of centrality measures under conditions of imperfect data," Social Networks, vol. 28, no. 2, pp. 124-136, 2006. (Pubitemid 43231304)
17. K. Avrachenkov, N. Litvak, D. Nemirovsky, and N. Osipova, "Monte carlo methods in pagerank computation: When one iteration is sufficient," SIAM J. Numer. Anal., vol. 45, pp. 890-904, February 2007. (Pubitemid 351599181)
18. K. Avrachenkov, N. Litvak, D. Nemirovsky, E. Smirnova, and M. Sokol, "Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation," INRIA, Tech Report RR-7367, 09 2010.