军事知识服务平台
Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap
摘要 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.
刊 名 中国物理B(英文版) ISTICEISCI
年,卷(期): 2012, 21(3)
分类号: O157.5
机标分类号: U66 TV3
在线出版日期: 2012年6月27日