Centrality measures are used to quantify the importance of a node in a given complex network. In the present work, we calculate the degree centrality ranking of a node without having entire network. The proposed method uses degree centrality value of the node and few network parameters to calculate ranking of a node. These network parameters are total number of nodes, minimum, maximum and average degree of the network. These parameters are calculated using sampling method. The proposed method is validated on Barabasi-Albert model. Simulation results show that the method gives good performance for higher degree nodes and it is decreased for lower degrees.
['Akrati Saxena', 'Vaibhav Malik', 'S. R. S. Iyengar']
Rank me thou shalln't Compare me