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 条
  • [21] From Continuous-Time Random Walks to Continuous-Time Quantum Walks: Disordered Networks
    Muelken, Oliver
    Blumen, Alexander
    NONLINEAR PHENOMENA IN COMPLEX SYSTEMS: FROM NANO TO MACRO SCALE, 2014, : 189 - 197
  • [22] Local trapping for elliptic random walks in random environments in Zd
    Fribergh, Alexander
    Kious, Daniel
    PROBABILITY THEORY AND RELATED FIELDS, 2016, 165 (3-4) : 795 - 834
  • [23] Mean first return time for random walks on weighted networks
    Jing, Xing-Li
    Ling, Xiang
    Long, Jiancheng
    Shi, Qing
    Hu, Mao-Bin
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2015, 26 (06):
  • [24] Mean Hitting Time for Random Walks on a Class of Sparse Networks
    Su, Jing
    Wang, Xiaomin
    Yao, Bing
    ENTROPY, 2022, 24 (01)
  • [25] Maps of random walks on complex networks reveal community structure
    Rosvall, Martin
    Bergstrom, Carl T.
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2008, 105 (04) : 1118 - 1123
  • [26] Random walks and diffusion on networks
    Masuda, Naoki
    Porter, Mason A.
    Lambiotte, Renaud
    PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2017, 716 : 1 - 58
  • [27] Random walks on bifractal networks
    Yakubo, Kousuke
    Shimojo, Gentaro
    Yamamoto, Jun
    PHYSICAL REVIEW E, 2024, 110 (06)
  • [28] Random walks on sensor networks
    Lima, Luisa
    Barros, Joao
    2007 5TH INTERNATIONAL SYMPOSIUM ON MODELING AND OPTIMIZATION IN MOBILE, AD HOC AND WIRELESS NETWORKS AND WORKSHOPS, VOLS 1-2, 2007, : 294 - 298
  • [29] Random Walks and Electric Networks
    Nachmias, Asaf
    PLANAR MAPS, RANDOM WALKS AND CIRCLE PACKING: ECOLE D'ETE DE PROBABILITES DE SAINT-FLOUR XLVIII - 2018, 2020, 2243 : 11 - 31
  • [30] Random walks on spatial networks
    Dou Fei-Ling
    Hu Yan-Qing
    Li Yong
    Fan Ying
    Di Zeng-Ru
    ACTA PHYSICA SINICA, 2012, 61 (17)