物理学报2012，Vol.61Issue(17)：571-577,7.
空间网络上的随机游走
Random walks on spatial networks
摘要
Abstract
In this paper, we construct a cost constrained spatial network by adding long-range connections to the one-dimensional circle. The probability for a long-range connection between nodes i and j is pijα dij^-α （α≥ 0）, where dij is the lattice distance and the total length of the long-range connections is set to be ∧=cN（c≥ 0）, where c is a positive constant and N is the network size. According to the simulation and numeric results, we find an optimal power-law exponent α0 such that the mean first-passage time is shortest. Furthermore, the shortest mean first-passage time has the power law relationships with the network size N. With the increase of network size N and the total cost ∧, the optimal power-law exponent α0 increases monotonically and approaches 1.5.关键词
空间网络/随机游走/能量约束/平均首达时间Key words
spatial networks/random walks/total energy constraint/mean first-passage time分类
数理科学引用本文复制引用
钭斐玲,胡延庆,黎勇,樊瑛,狄增如..空间网络上的随机游走[J].物理学报,2012,61(17):571-577,7.基金项目
中央高校基本科研业务费专项资金、国家自然科学基金（批准号：60974084,61174150）和NCET-09-0228资助的课题 （）
