Effective target arrangement in a deterministic scale-free graph

被引:44
作者
Agliari, E. [1 ,2 ,3 ]
Burioni, R. [1 ,2 ]
Manzotti, A. [1 ]
机构
[1] Univ Parma, Dipartimento Fis, I-43100 Parma, Italy
[2] Grp Collegato Parma, Ist Nazl Fis Nucl, I-43100 Parma, Italy
[3] Univ Freiburg, D-79104 Freiburg, Germany
来源
PHYSICAL REVIEW E | 2010年 / 82卷 / 01期
关键词
RANDOM-WALKS; 1ST-PASSAGE TIMES; EFFICIENCY; LATTICES;
D O I
10.1103/PhysRevE.82.011118
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We study the random-walk problem on a deterministic scale-free network, in the presence of a set of static, identical targets; due to the strong inhomogeneity of the underlying structure the mean first-passage time (MFPT), meant as a measure of transport efficiency, is expected to depend sensitively on the position of targets. We consider several spatial arrangements for targets and we calculate, mainly rigorously, the related MFPT, where the average is taken over all possible starting points and over all possible paths. For all the cases studied, the MFPT asymptotically scales like similar to N-theta, being N the volume of the substrate and theta ranging from 1-log 2/log 3, for central target (s), to 1, for a single peripheral target.
引用
收藏
页数:9
相关论文
共 31 条
  • [31] Exact solution for mean first-passage time on a pseudofractal scale-free web
    Zhang, Zhongzhi
    Qi, Yi
    Zhou, Shuigeng
    Xie, Wenlei
    Guan, Jihong
    [J]. PHYSICAL REVIEW E, 2009, 79 (02)