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: | , , , , |
|---|---|
| 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 |