Abstract:
Identifying top-ranked nodes can be performed using different centrality measures, based on their characteristics and influential power. The most basic of all the ranking techniques is based on nodes degree. While finding the degree of a node requires local information, ranking the node based on its degree requires global information, namely the degrees of all the nodes of the network. It is infeasible to collect the global information for some graphs such as (i) the ones emerging from big data, (ii) dynamic networks, and (iii) distributed networks in which the whole graph is not known. In this work, we propose methods to estimate the degree rank of a node, that are faster than the classical method of computing the centrality value of all nodes and then rank a node. The proposed methods are modeled based on the network characteristics and sampling techniques, thus not requiring the entire network. We show that approximately 1% node samples are adequate to find the rank of a node with high accuracy.
