A ranking method based on self-avoiding random walk in complex networks

Abstract

Evaluation of node importance is helpful to improve the invulnerability and robustness of complex networked systems. At present, the classic ranking methods of quantitatively analyzing node importance are based on the centrality measurements of network topology, such as degree, betweenness, closeness, eigenvector, etc. Therefore, they often restrict the unknown topological information and are not convenient to use in large-scale real networked systems. In this paper, according to the idea of self-avoiding random walking, we propose a novel and simplified ranking method integrated with label propagation and local topological information, in which the number of labels that node collects from propagating process quantitatively denotes the ranking order. Moreover, the proposed method is able to characterize the structural influence and importance of node in complex networked system because it comprehensively considers both the direct neighbors of node and the topological relation of node to other ones. Through performing the experiments on three benchmark networks, we obtain interesting results derived from four common evaluating indices, i. e., the coefficient of giant component, the spectral distance, the links of node, and the fragility, which indicate that the proposed method is much more efficient and effective for ranking influential nodes than the acquaintance algorithm.