Random walks in generalized delayed recursive trees  

作　　者：孙伟刚 张静远 陈关荣 

机构地区：[1]Institute of Applied Mathematics and Engineering Computations,Hangzhou Dianzi University [2]Department of Electronic Engineering,City University of Hong Kong,SAR

出　　处：《Chinese Physics B》2013年第10期654-660,共7页中国物理B（英文版）

基　　金：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);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.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 

分 类 号：O211.6[理学—概率论与数理统计]