Random Walks on Deterministic Weighted Scale-Free Small-World Networks with a Perfect Trap  

作　　者：景兴利 凌翔 胡茂彬 石琴 

机构地区：[1]SchoolofTransportationEngineering,HefeiUniversityofTechnology,Hefei230009 [2]SchoolofEngineeringScience,UniversityofScienceandTechnologyofChina,Hefei230026

出　　处：《Chinese Physics Letters》2014年第8期16-19,共4页中国物理快报（英文版）

基　　金：Supported by the National Natural Science Foundation of China under Grant Nos 71301043, 71171185, and 71071044, and the 1000 Talent Plan for High-Level Foreign Experts under Grant No WQ20123400070.

摘　　要：Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world networks with a perfect trap. We derive an explicit expression of the mean first passage time on the network with a trap. Meanwhile, we present the evolutionary rule for the first passage time when the network grows. The study can be useful for understanding the random walks on weighted networks.Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world networks with a perfect trap. We derive an explicit expression of the mean first passage time on the network with a trap. Meanwhile, we present the evolutionary rule for the first passage time when the network grows. The study can be useful for understanding the random walks on weighted networks.

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术] TN915[自动化与计算机技术—计算机科学与技术]