首页
登录
注册
无标度立体Koch网络上随机游走的平均吸收时间
Exact solution for mean trapping time of random walk on a scale-free Koch network
-
摘要: 作为一种基本的动力学过程，复杂网络上的随机游走是当前学术界研究的热点问题，其中精确计算带有陷阱的随机游走过程的平均吸收时间（meantrappingtime，MTT）是该领域的一个难点．这里的MTT定义为从网络上任意一个节点出发首次到达设定陷阱的平均时间．本文研究了无标度立体Koch网络上带有一个陷阱的随机游走问题，解析计算了陷阱置于网络中度最大的节点这一情形的网络MTT指标．通过重正化群方法，利用网络递归生成的模式，给出了立体Koch网络上MTF的精确解，所得计算结果与数值解一致，并且从所得结果可以看出，立体Koch网络的MTT随着网络节点数Ⅳ呈线性增长．最后，将所得结果与之前研究的完全图、规则网络、Sierpinski网络和T分形网络进行比较，结果表明Koch网络具有较高的传输效率．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.
-
-
计量
- 文章访问数: 589
- HTML全文浏览数: 35
- PDF下载数: 0
- 施引文献: 0
下载: