Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/88714
Title: Mean first passage time of preferential random walks on complex networks with applications
Authors: Zheng, Zhongtuan
Xiao, Gaoxi
Wang, Guoqiang
Zhang, Guanglin
Jiang, Kaizhong
Keywords: Preferential Random Walks
Complex Networks
DRNTU::Engineering::Electrical and electronic engineering
Issue Date: 2017
Source: Zheng, Z., Xiao, G., Wang, G., Zhang, G., & Jiang, K. (2017). Mean first passage time of preferential random walks on complex networks with applications. Mathematical Problems in Engineering, 2017, 8217361-. doi:10.1155/2017/8217361
Series/Report no.: Mathematical Problems in Engineering
Abstract: 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 terms of the eigenvalues and eigenvectors of a matrix associated with the transition matrix of PRW. On the other hand, the center-product-degree (CPD) is introduced as one measure of node strength and it plays a main role in determining the scaling of the MFPT for the PRW. Comparative studies are also performed on PRW and simple random walks (SRW). Numerical simulations of random walks on paradigmatic network models confirm analytical predictions and deepen discussions in different aspects. The work may provide a comprehensive approach for exploring random walks on complex networks, especially biased random walks, which may also help to better understand and tackle some practical problems such as search and routing on networks.
URI: https://hdl.handle.net/10356/88714
http://hdl.handle.net/10220/45889
ISSN: 1024-123X
DOI: http://dx.doi.org/10.1155/2017/8217361
Rights: © 2017 Zhongtuan Zheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:EEE Journal Articles

Files in This Item:
File Description SizeFormat 
Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications.pdf665.96 kBAdobe PDFThumbnail
View/Open

Google ScholarTM

Check

Altmetric

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.