Controlling the efficiency of trapping in a scale-free small-world network

被引:14
|
作者
Lin, Yuan [1 ,2 ]
Zhang, Zhongzhi [1 ,2 ]
机构
[1] Fudan Univ, Sch Comp Sci, Shanghai 200433, Peoples R China
[2] Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China
来源
SCIENTIFIC REPORTS | 2014年 / 4卷
基金
中国国家自然科学基金;
关键词
RANDOM-WALKS; INVARIANCE RELATIONS; 1ST-PASSAGE TIMES; COMPLEX; CONTROLLABILITY; DENDRIMERS; DIFFUSION; DYNAMICS; GEOMETRY;
D O I
10.1038/srep06274
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Designing appropriate techniques to effectively control the trapping process in complex systems towards desirable efficiency is of paramount importance in the study of trapping problem. In this paper, we present three different methods guiding trapping process in a scale-free small-world network with a deep trap positioned at an initial node. All the proposed approaches dominate the trapping process by varying the transition probability of random walks. In the first two techniques, the transition probability is modified by an introduced weight parameter and a stochastic parameter, respectively. And the third scheme is a combination of the first two approaches, controlled by both parameters synchronously. For all the three control strategies, we derive both analytically and numerically the average trapping time (ATT) as the measure of the trapping efficiency, with the obtained explicit expressions being in good agreement with their corresponding exact numerical solutions. Our results indicate that the weight parameter changes simultaneously the dominating scaling of ATT and its prefactor. Different from the weight parameter, the stochastic parameter only modifies the prefactor, keeping the leading scaling unchanged. Finally, compared with the first two manners, the third strategy is a fine control, possessing the advantages of the first two ones. This work deepens the understanding of controlling trapping process in complex systems.
引用
收藏
页数:8
相关论文
共 50 条
  • [21] Self-organized criticality in cortical assemblies occurs in concurrent scale-free and small-world networks
    Massobrio, Paolo
    Pasquale, Valentina
    Martinoia, Sergio
    SCIENTIFIC REPORTS, 2015, 5
  • [22] A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters
    Ma, Fei
    Su, Jing
    Hao, Yongxing
    Yao, Bing
    Yan, Guanghui
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 492 : 1194 - 1205
  • [23] Optimal scale-free network with a minimum scaling of transport efficiency for random walks with a perfect trap
    Yang, Yihang
    Zhang, Zhongzhi
    JOURNAL OF CHEMICAL PHYSICS, 2013, 138 (03)
  • [24] Regular Small-World Network
    Zou Zhi-Yun
    Mao Bao-Hua
    Hao Hai-Ming
    Gao Jian-Zhi
    Yang Jie-Jiao
    CHINESE PHYSICS LETTERS, 2009, 26 (11)
  • [25] Long-term effect of relay protection operation on cascading failures in growing scale-free small-world power grid
    Zhang, Yudong
    Bao, Zhejing
    Cao, Yijia
    2012 IEEE POWER AND ENERGY SOCIETY GENERAL MEETING, 2012,
  • [26] Scale-free homophilic network
    de Almeida, Mauricio L.
    Mendes, Gabriel A.
    Viswanathan, G. Madras
    da Silva, Luciano R.
    EUROPEAN PHYSICAL JOURNAL B, 2013, 86 (02)
  • [27] ATTACK VULNERABILITY OF FRACTAL SCALE-FREE NETWORK
    Guo, Feiyan
    Qi, Lin
    Fan, Ying
    FRACTALS-COMPLEX GEOMETRY PATTERNS AND SCALING IN NATURE AND SOCIETY, 2024, 32 (03)
  • [28] Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition
    Li, Li
    Jia, Qing-Shan
    Guan, Xiaohong
    Wang, Hengtao
    KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2012, 6 (05): : 1333 - 1353
  • [29] The small-world network of global protests
    Ferreira, Leonardo N.
    Hong, Inho
    Rutherford, Alex
    Cebrian, Manuel
    SCIENTIFIC REPORTS, 2021, 11 (01)
  • [30] Is the brain really a small-world network?
    Hilgetag, Claus C.
    Goulas, Alexandros
    BRAIN STRUCTURE & FUNCTION, 2016, 221 (04) : 2361 - 2366