Effective trapping of random walkers in complex networks.

Exploring the World Wide Web has become one of the key issues in information science, specifically in view of its application to the PageRank-like algorithms used in search engines. The random walk approach has been employed to study such a problem. The probability of return to the origin (RTO) of random walks is inversely related to how information can be accessed during random surfing. We find analytically that the RTO probability for a given starting node shows a crossover from a slow to a fast decay behavior with time and the crossover time increases with the degree of the starting node. We remark that the RTO probability becomes almost constant in the early-time regime as the degree exponent approaches two. This result indicates that a random surfer can be effectively trapped at the hub and supports the necessity of the random jump strategy empirically used in the Google's search engine.

[1]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[2]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[3]  B Kahng,et al.  Spectral dimensions of hierarchical scale-free networks with weighted shortcuts. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[5]  Sidney Redner,et al.  A guide to first-passage processes , 2001 .

[6]  Michael Hinczewski,et al.  Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  Hernán D Rozenfeld,et al.  Percolation in hierarchical scale-free nets. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Shlomo Havlin,et al.  Fractal and transfractal recursive scale-free nets , 2007 .

[9]  Marc Najork,et al.  Measuring Index Quality Using Random Walks on the Web , 1999, Comput. Networks.

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

[11]  Shlomo Havlin,et al.  Origins of fractality in the growth of complex networks , 2005, cond-mat/0507216.

[12]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[13]  W. Helfrich.  Mean-field theory of statistical assemblies of sterically interacting lines , 1983 .