Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap |
| |
Authors: | Zhang Jing-Yuan a Sun Wei-Gang a and Chen Guan-Rong |
| |
Institution: | b) a) School of Science,Hangzhou Dianzi University,Hangzhou 310018,China b) Department of Electronic Engineering,City University of Hong Kong,Hong Kong SAR,China |
| |
Abstract: | In this paper,we study the scaling for the mean first-passage time(MFPT) of the random walks on a generalized Koch network with a trap.Through the network construction,where the initial state is transformed from a triangle to a polygon,we obtain the exact scaling for the MFPT.We show that the MFPT grows linearly with the number of nodes and the dimensions of the polygon in the large limit of the network order.In addition,we determine the exponents of scaling efficiency characterizing the random walks.Our results are the generalizations of those derived for the Koch network,which shed light on the analysis of random walks over various fractal networks. |
| |
Keywords: | mean first-passage time random walks Koch networks |
本文献已被 CNKI 维普 等数据库收录! |
|