Expanded Koch networks: structure and trapping time of random walks

被引:8
|
作者
Hou, Baoyu [1 ]
Zhang, Hongjuan [1 ]
Liu, Li [2 ]
机构
[1] Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China
[2] Anhui Normal Univ, Coll Territorial Resources & Tourism, Wuhu 241002, Anhui, Peoples R China
来源
EUROPEAN PHYSICAL JOURNAL B | 2013年 / 86卷 / 04期
基金
中国国家自然科学基金;
关键词
RESISTANCE DISTANCE; 1ST-PASSAGE TIMES; COMPLEX;
D O I
10.1140/epjb/e2013-30905-x
中图分类号
O469 [凝聚态物理学];
学科分类号
070205 ;
摘要
Based on the Koch network constructed using Koch fractals, we proposed a class of expanded Koch networks in this paper. The original triangle is replaced by r-polygon, and each node generates m sub r-polygons by every step, which makes the Koch network more general. We studied the structure and properties of the networks. The exact analytical result of the degree distribution, clustering coefficient and average path length were obtained. When parameters m and r satisfy some certain conditions, the networks follow a power-law distribution and have a small average path length. Finally, we introduced the random walk on the network. Our discussions focused on the trapping problem, particularly the calculation and derivation of mean first passage time (MFPT) and global mean first passage time (GMFPT). In addition, we also gave the relationship between the above results and the network size.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap
    张静远
    孙伟刚
    陈关荣
    Chinese Physics B, 2012, (03) : 525 - 529
  • [42] Mean first-passage time for random walks on undirected networks
    Zhang, Zhongzhi
    Julaiti, Alafate
    Hou, Baoyu
    Zhang, Hongjuan
    Chen, Guanrong
    EUROPEAN PHYSICAL JOURNAL B, 2011, 84 (04): : 691 - 697
  • [43] TRAPPING OF RANDOM-WALKS IN 2 AND 3 DIMENSIONS
    HAVLIN, S
    DISHON, M
    KIEFER, JE
    WEISS, GH
    PHYSICAL REVIEW LETTERS, 1984, 53 (05) : 407 - 410
  • [44] Low-Mean Hitting Time for Random Walks on Heterogeneous Networks
    Sheng, Yibin
    Zhang, Zhongzhi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (11) : 6898 - 6910
  • [45] Mean first-passage time for random walks on undirected networks
    Zhongzhi Zhang
    Alafate Julaiti
    Baoyu Hou
    Hongjuan Zhang
    Guanrong Chen
    The European Physical Journal B, 2011, 84 : 691 - 697
  • [46] Exact solution for mean trapping time of random walk on a scale-free Koch network
    Xing Chang-Ming
    Liu Fang-Ai
    Xu Ru-Zhi
    ACTA PHYSICA SINICA, 2012, 61 (20)
  • [47] Random walks and the regeneration time
    Beveridge, A
    Lovasz, L
    JOURNAL OF GRAPH THEORY, 1998, 29 (02) : 57 - 62
  • [48] AVERAGE TRAPPING TIME OF HONEYPOTS ON WEIGHTED RANDOM FRACTAL NETWORKS
    Huang, Yuke
    Zeng, Cheng
    Zhang, Hanxiong
    Xue, Yumei
    FRACTALS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY, 2022, 30 (07)
  • [49] All-time dynamics of continuous-time random walks on complex networks
    Teimouri, Hamid
    Kolomeisky, Anatoly B.
    JOURNAL OF CHEMICAL PHYSICS, 2013, 138 (08):
  • [50] Branching random walks with random environments in time
    Chunmao Huang
    Xingang Liang
    Quansheng Liu
    Frontiers of Mathematics in China, 2014, 9 : 835 - 842