摘要：It exerts significant impact on the research of complex networks to evaluate the importance of nodes. A new method of the node ranks based on neighbor lines and local network structure was proposed in this paper. Firstly, the local network structure is considered as a sub-network structure which is consisted of a number of layers of neighbor nodes. Then, the attributes of neighbor nodes are used to compute the importance of the nodes within local network structure. Finally, the contributions of neighbor lines are merged to estimate the importance value of nodes. Both the attribute information of the neighbor lines and local structure information are taken into consideration in this paper. In order to verify the performance of the method presented in this paper, the experiments have been carried out on European grid, dolphin social network, contiguous USA network and the US grid. The results indicate the method proposed in this paper is feasible and the nodes of the complex networks can be ranked effectively by importance.
