物理学报2012，Vol.61Issue(20)：97-104,8.
无标度立体Koch网络上随机游走的平均吸收时间
Exact solution for mean trapping time of random walk on a scale-free Koch network
摘要
Abstract
As a basic dynamical process, random walk on networks is fundamental to many branches of science, and has attracted much attention. A difficult problem in the study of random walk is how to obtain the exact solution for the mean trapping time (MTT) of this process. The MTT is defined as the mean time for the walker staring from any node in the network to first reach the trap node. In this paper, we study random walk on the Koch network with a trap located at the highest degree node and calculate the solution for MTT. The accurate expression for the MTr is obtained through the recurrence relation and the structure properties of the Koch network. We confirm the correctness of the MTT result by direct numerical calculations based on the Laplacian matrix of Koch network. It can be seen from the obtained results that in the large limit of network size, the MTT increases linearly with the size of network increasing. Comparison between the MTT result of the Koch network with that of the other networks, such as complete graph, regular lattices, Sierpinski fractals, and T-graph, shows that the Koch has a high transmission efficiency.关键词
复杂网络/Koch网络/随机游走/平均吸收时间Key words
complex networks/Koch network/random walk/mean trapping time分类
数理科学引用本文复制引用
邢长明,刘方爱,徐如志..无标度立体Koch网络上随机游走的平均吸收时间[J].物理学报,2012,61(20):97-104,8.基金项目
国家自然科学基金,(批准号：71171122,90612003),山东省自然科学基金,(批准号：ZR2010FM003,2009ZRB019PF)和山东高校科研发展计划,(批准号：J11LG11)资助的课题. （批准号：71171122,90612003）
