The High Degree Seeking Algorithms with k Steps for Complex Networks

Search in complex network is an open issue, lots of algorithms have been proposed, however, most of them have their own shortcomings such as stepping slow or checking too many nodes. This paper presents a new high degree seeking algorithm with k steps in order to solve this problems for scale-free networks. This algorithm not only enables fast access to distant nodes, but also reduce the average search steps and check fewer nodes. Simulations are carried out to illustrate the performance of the proposed method.

[1]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[2]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[3]  Soundar Kumara,et al.  Search in spatial scale-free networks , 2007 .

[4]  F Jasch,et al.  Target problem on small-world networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[6]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[7]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[8]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[9]  S. Bornholdt,et al.  Handbook of Graphs and Networks , 2012 .

[10]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Copenhagen,et al.  Hide-and-seek on complex networks , 2005 .

[12]  Beom Jun Kim,et al.  Path finding strategies in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[14]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[15]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[16]  Lada A. Adamic,et al.  Local Search in Unstructured Networks , 2002, ArXiv.

[17]  Ernesto Estrada,et al.  Communicability betweenness in complex networks , 2009, 0905.4102.

[18]  Agata Fronczak,et al.  Mean-field theory for clustering coefficients in Barabási-Albert networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .