Random walks in small-world exponential treelike networks

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the initial node. We obtain the exact mean trapping time defined as the average of the first-passage times (FPT) from all nodes to the trap, which scales linearly with the network order N in large networks. Then, we determine analytically the mean sending time, which is the mean of the FPTs from the initial node to all other nodes, and show that it grows with N, varying approximately as NlnN. After that, we compute the precise global mean first-passage time among all pairs of nodes and find that it also varies approximately as NlnN in the large limit of N. After obtaining the relevant quantities, we compare them with each other and relate our results to the efficiency for information transmission by regarding the walker as an information messenger. Finally, we compare our results with those previously reported for other trees with different structural properties (e.g., degree distribution), such as the standard fractal trees and the scale-free small-world trees, and show that the shortest path between a pair of nodes in a tree is responsible for the scaling of the FPT between the two nodes.

[1]  P. Tetali.  Random walks and the effective resistance of networks , 1991 .

[2]  E. Agliari,et al.  Exact mean first-passage time on the T-graph. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[5]  D. Parisi,et al.  Comparison of voter and Glauber ordering dynamics on networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Sergey N. Dorogovtsev,et al.  Critical phenomena in complex networks , 2007, ArXiv.

[7]  Bin Wu,et al.  Determining mean first-passage time on a class of treelike regular fractals. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[9]  Shuigeng Zhou,et al.  Recursive solutions for Laplacian spectra and eigenvectors of a class of growing treelike networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Heiko Rieger,et al.  Constrained spin-dynamics description of random walks on hierarchical scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Zhongzhi Zhang,et al.  Effect of trap position on the efficiency of trapping in treelike scale-free networks , 2011 .

[12]  J. Klafter,et al.  First-passage times in complex scale-invariant media , 2007, Nature.

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

[14]  Shuigeng Zhou,et al.  Structural and spectral properties of a family of deterministic recursive trees: rigorous solutions , 2008, 0812.1456.

[15]  A. Roberts,et al.  Global first-passage times of fractal lattices. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Luciano da F. Costa,et al.  Border trees of complex networks , 2007, 0706.3403.

[17]  O. Bénichou,et al.  Global mean first-passage times of random walks on complex networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Tamás Vicsek,et al.  Fractal models for diffusion controlled aggregation , 1983 .

[19]  J. Stoyanov.  A Guide to First‐passage Processes , 2003 .

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

[21]  B. Kahng,et al.  Geometric fractal growth model for scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  R. Pastor-Satorras,et al.  Random walks on complex trees. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[24]  Francesc Comellas,et al.  Mean first-passage time for random walks on generalized deterministic recursive trees. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[26]  H. Stanley,et al.  Fractal boundaries of complex networks , 2008, 0804.1968.

[27]  Sidney Redner,et al.  Scaling of the first-passage time and the survival probability on exact and quasi-exact self-similar structures , 1989 .

[28]  Vittorio Loreto,et al.  Nonequilibrium dynamics of language games on complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  Gregg Lois,et al.  Protein folding on rugged energy landscapes: conformational diffusion on fractal networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  J. Guan,et al.  Mean first-passage time for random walks on the T-graph , 2009, 0907.3251.

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

[32]  S N Dorogovtsev,et al.  Degree-dependent intervertex separation in complex networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  M. A. Fiol,et al.  On The Spectra of Hypertrees , 2008 .

[34]  O Bénichou,et al.  First-passage times for random walks in bounded domains. , 2005, Physical review letters.

[35]  Shuigeng Zhou,et al.  Determining global mean-first-passage time of random walks on Vicsek fractals using eigenvalues of Laplacian matrices. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[36]  Erik M. Bollt,et al.  What is Special about Diffusion on Scale-Free Nets? , 2004 .

[37]  Lali Barrière,et al.  On the hierarchical product of graphs and the generalized binomial tree , 2009 .

[38]  Sibani,et al.  Hierarchical models for aging and relaxation of spin glasses. , 1989, Physical review letters.

[39]  Douglas H. Fisher,et al.  Knowledge Acquisition Via Incremental Conceptual Clustering , 1987, Machine Learning.