Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications
This paper investigates, both theoretically and numerically, preferential random walks (PRW) on weighted complex networks. By using two different analytical methods, two exact expressions are derived for the mean first passage time (MFPT) between two nodes. On one hand, the MFPT is got explicitly in...
Main Authors: | Zhongtuan Zheng, Gaoxi Xiao, Guoqiang Wang, Guanglin Zhang, Kaizhong Jiang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2017-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2017/8217361 |
Similar Items
-
Estimating mean first passage time of biased random walks with short relaxation time on complex networks.
by: Zhuo Qi Lee, et al.
Published: (2014-01-01) -
Comparison of Multiple Random Walks Strategies for Searching Networks
by: Zhongtuan Zheng, et al.
Published: (2013-01-01) -
Random walks and first-passage properties: Trajectory analysis and search optimization
by: Tejedor, Vincent
Published: (2012) -
The Computation of the Mean First Passage Times for Markov Chains
by: Hunter, J
Published: (2018) -
First passage times
by: Chowdhury, Debashish
Published: (2015)