Mean first passage time of preferential random walks on complex networks with applications

• المؤلفون الرئيسيون: Zheng, Zhongtuan, Xiao, Gaoxi, Wang, Guoqiang, Zhang, Guanglin, Jiang, Kaizhong
• مؤلفون آخرون: School of Electrical and Electronic Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2018
• الموضوعات: Preferential Random Walks; Complex Networks; DRNTU::Engineering::Electrical and electronic engineering
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/88714; http://hdl.handle.net/10220/45889

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...