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...
Saved in:
Main Authors: | Zheng, Zhongtuan, Xiao, Gaoxi, Wang, Guoqiang, Zhang, Guanglin, Jiang, Kaizhong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/88714 http://hdl.handle.net/10220/45889 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Degree asymptotics with rates for preferential attachment random graphs
by: Peköz, E.A., et al.
Published: (2014) -
Modelling collaboration networks based on nonlinear preferential attachment
by: Zhou, T., et al.
Published: (2014) -
Random walk and web information processing for mobile devices
by: YIN XINYI
Published: (2010) -
Temporary equililibrium dynamics with learning: The stability of random walk beliefs
by: CHATTERJI, Shurojit
Published: (1996) -
On the hitting times of quantum versus random walks
by: Magniez, F., et al.
Published: (2014)