Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world netw...Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world networks with a perfect trap. We derive an explicit expression of the mean first passage time on the network with a trap. Meanwhile, we present the evolutionary rule for the first passage time when the network grows. The study can be useful for understanding the random walks on weighted networks.展开更多
基金Supported by the National Natural Science Foundation of China under Grant Nos 71301043, 71171185, and 71071044, and the 1000 Talent Plan for High-Level Foreign Experts under Grant No WQ20123400070.
文摘Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world networks with a perfect trap. We derive an explicit expression of the mean first passage time on the network with a trap. Meanwhile, we present the evolutionary rule for the first passage time when the network grows. The study can be useful for understanding the random walks on weighted networks.
