Ripple Algorithm to Evaluate the Importance of Network Nodes

Abstract

Inthis paper raise the ripples algorithm to evaluate the importance of network node was proposed, its principle is based onthe direct influence of adjacent nodes, and affect farther nodes indirectlyby closer ones just like the ripples on the water. Then we defined two judgments,the discriminationof node importance and the accuracy of key node selecting, to verify its efficiency. The greater degree of discriminationand higher accuracy means better efficiency of algorithm. At last we performed experiment on ARPA network, to compare the efficiency of different algorithms, closeness centricity, node deletion, node contraction method, algorithm raised by Zhou Xuan etc. and ripple method. Results show that ripple algorithm is better than the other measures in the discrimination of node importance and the accuracy of key node selecting.