首页 | 本学科首页   官方微博 | 高级检索  
     

广义伪分形网络上随机游走的平均首达时间的精确幂律
引用本文:童丽艳,刘阳,孙伟刚,李常品. 广义伪分形网络上随机游走的平均首达时间的精确幂律[J]. 应用数学与计算数学学报, 2012, 26(2): 176-184
作者姓名:童丽艳  刘阳  孙伟刚  李常品
作者单位:1. 上海大学理学院,上海,200444
2. 内蒙古财经学院统计与数学学院,呼和浩特,010070
3. 杭州电子科技大学理学院,杭州,310018
基金项目:基金项目:国家自然科学基金资助项目
摘    要:研究具有一个吸收点的广义伪分形网络上随机游走的平均首达时间.广义伪分形网络的显著特点是在每一次迭代中,每条现有的边会产生有限个节点.根据网络的演化算法,得到了平均首达时间的精确表达式.当网络的阶数足够大时,平均首达时间是按照网络节点数的幂律在增长.此外,可以通过改变网络参数来改善此类网络的随机游走的效率.这些研究结果是对伪分形网络相应结果的推广,将为深入研究各类分形网络的随机游走提供帮助.

关 键 词:伪分形网络  随机游走  平均首达时间

Exact scaling for mean first-passage time of random walks on generalized pseudofractal web
TONG Li-yan,LIU Yang,SUN Wei-gang,LI Chang-pin. Exact scaling for mean first-passage time of random walks on generalized pseudofractal web[J]. Communication on Applied Mathematics and Computation, 2012, 26(2): 176-184
Authors:TONG Li-yan  LIU Yang  SUN Wei-gang  LI Chang-pin
Affiliation:1 (1.College of Sciences,Shanghai University,Shanghai 200444,China; 2.School of Statistics and Mathematics,Inner Mongolia Finance and Economics College, Hohhot 010070,China; 3.School of Science,Hangzhou Dianzi University,Hanezhou 310018,China)
Abstract:The scaling of mean first-passage time(MFPT) for random walks on the generalized pseudofractal web(GPFW) with a trap is studied.The feature of the GPFW is that every existing edge produces finite nodes in each evolution step.Through the web construction,the exact scaling for the MFPT is obtained. The MPFT grows as a power-law function with the number of nodes in the large limit of network order.In addition,the efficiency of random walks on this kind of web can be improved through changing the network parameter.These results are generalizations of those derived for the pseudofractal web,which shed some lights on the analysis of random walks over various fractal networks.
Keywords:pseudofractal web  random walk  mean first-passage time
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号