Title :
Online estimating the k central nodes of a network
Author :
Lim, Yeon-sup ; Menasché, Daniel S. ; Ribeiro, Bruno ; Towsley, Don ; Basu, Prithwish
Abstract :
The goal of this paper is to estimate the k most central nodes in a network through parsimonious sampling. Centrality determines the relative importance of a particular node within the network. Conventional measures of node centrality include degree, betweenness, and closeness.
Keywords :
Internet; network theory (graphs); sampling methods; node centrality; online central node estimation; parsimonious sampling; Algorithm design and analysis; Approximation algorithms; Approximation methods; Collaboration; Correlation; Measurement; Social network services;
Conference_Titel :
Network Science Workshop (NSW), 2011 IEEE
Conference_Location :
West Point, NY
Print_ISBN :
978-1-4577-1049-0
DOI :
10.1109/NSW.2011.6004633
