中国物理B ›› 2013, Vol. 22 ›› Issue (10): 108904-108904.doi: 10.1088/1674-1056/22/10/108904

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    下一篇

Random walks in generalized delayed recursive trees

孙伟刚a, 张静远a, 陈关荣b   

  1. a Institute of Applied Mathematics and Engineering Computations, Hangzhou Dianzi University, Hangzhou 310018, China;
    b Department of Electronic Engineering, City University of Hong Kong, SAR, Hong Kong, China
  • 收稿日期:2013-03-08 修回日期:2013-04-13 出版日期:2013-08-30 发布日期:2013-08-30
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 61203155 and 11232005), the Natural Science Foundation of Zhejiang Province, China (Grant No. LQ12F03003), and the Hong Kong Research Grants Council under the GRF Grant CityU (Grant No. 1109/12).

Random walks in generalized delayed recursive trees

Sun Wei-Gang (孙伟刚)a, Zhang Jing-Yuan (张静远)a, Chen Guan-Rong (陈关荣)b   

  1. a Institute of Applied Mathematics and Engineering Computations, Hangzhou Dianzi University, Hangzhou 310018, China;
    b Department of Electronic Engineering, City University of Hong Kong, SAR, Hong Kong, China
  • Received:2013-03-08 Revised:2013-04-13 Online:2013-08-30 Published:2013-08-30
  • Contact: Sun Wei-Gang E-mail:wgsun@hdu.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 61203155 and 11232005), the Natural Science Foundation of Zhejiang Province, China (Grant No. LQ12F03003), and the Hong Kong Research Grants Council under the GRF Grant CityU (Grant No. 1109/12).

摘要: Recently a great deal of effort has been made to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs of nodes on a fractal network. In this paper, we first propose a family of generalized delayed recursive trees characterized by two parameters, where the existing nodes have a time delay to produce new nodes. We then study the MFPT of random walks on this kind of recursive tree and investigate the effect of the time delay on the MFPT. By relating random walks to electrical networks, we obtain an exact formula for the MFPT and verify it by numerical calculations. Based on the obtained results, we further show that the MFPT of delayed recursive trees is much shorter, implying that the efficiency of random walks is much higher compared with the non-delayed counterpart. Our study provides a deeper understanding of random walks on delayed fractal networks.

关键词: mean first-passage time, random walk, delayed recursive tree

Abstract: Recently a great deal of effort has been made to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs of nodes on a fractal network. In this paper, we first propose a family of generalized delayed recursive trees characterized by two parameters, where the existing nodes have a time delay to produce new nodes. We then study the MFPT of random walks on this kind of recursive tree and investigate the effect of the time delay on the MFPT. By relating random walks to electrical networks, we obtain an exact formula for the MFPT and verify it by numerical calculations. Based on the obtained results, we further show that the MFPT of delayed recursive trees is much shorter, implying that the efficiency of random walks is much higher compared with the non-delayed counterpart. Our study provides a deeper understanding of random walks on delayed fractal networks.

Key words: mean first-passage time, random walk, delayed recursive tree

中图分类号:  (Structures and organization in complex systems)

  • 89.75.Fb
89.75.Hc (Networks and genealogical trees) 05.40.Fb (Random walks and Levy flights)