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: | , , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2018
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/88714 http://hdl.handle.net/10220/45889 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|