中国物理B ›› 2017, Vol. 26 ›› Issue (2): 20201-020201.doi: 10.1088/1674-1056/26/2/020201
• GENERAL • 下一篇
Yu Sun(孙昱), Pei-Yang Yao(姚佩阳), Lu-Jun Wan(万路军), Jian Shen(申健), Yun Zhong(钟赟)
Yu Sun(孙昱)1, Pei-Yang Yao(姚佩阳)1, Lu-Jun Wan(万路军)2, Jian Shen(申健)1, Yun Zhong(钟赟)1
摘要: In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented. First, the concept of an importance sequence (IS) to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks.
中图分类号: (Combinatorics; graph theory)