Exploring the optimal network topology for spreading dynamics

被引:6
作者
Wang, Dong [1 ]
Small, Michael [2 ,3 ]
Zhao, Yi [1 ]
机构
[1] Harbin Inst Technol Shenzhen, Sch Sci, Shenzhen 518055, Peoples R China
[2] Univ Western Australia, Dept Math & Stat, Complex Syst Grp, 35 Stirling Highway, Crawley, WA 6009, Australia
[3] Commonwealth Sci & Ind Res Org, Mineral Resources, 26 Dick Perry Ave, Kensington, WA 6151, Australia
基金
国家重点研发计划;
关键词
Complex networks; Spreading dynamics; Perturbation method; SIS model; COMPLEX; IDENTIFICATION; INFORMATION;
D O I
10.1016/j.physa.2020.125535
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Complex networks are a useful method to model many real-world systems from society to biology. Spreading dynamics of complex networks has attracted more and more attention and is currently an area of intense interest. In this study, by applying a perturbation approach to an individual-based susceptible-infected-susceptible (SIS) model, we derive an estimation of the incremental spreading prevalence after the network adds a single link and then propose a strategy to find the corresponding optimal link to promote spreading prevalence. Through theoretical analysis, we notice that the proposed strategy can be approximately interpreted by the eigenvector centrality when the infection probability is near the spreading critical point. By comparing the incremental prevalence of several typical synthetic and real networks, we find that the proposed strategy is superior to other methods such as linking nodes with the highest degree and eigenvector centrality. Moreover, the optimal link structure has degree mixing characteristics distinguishable for different spreading parameters. We further demonstrate this finding based on the degree-preserving network configuration model with different rich-club and assortativity coefficients. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:8
相关论文
共 43 条
[1]   Successful strategies for competing networks [J].
Aguirre, J. ;
Papo, D. ;
Buldu, J. M. .
NATURE PHYSICS, 2013, 9 (04) :230-234
[2]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[3]  
BONACICH P, 1987, AM J SOCIOL, V92, P1170, DOI 10.1086/228631
[4]  
Bounova G., 2015, Octave Networks Toolbox
[5]   The Hidden Geometry of Complex, Network-Driven Contagion Phenomena [J].
Brockmann, Dirk ;
Helbing, Dirk .
SCIENCE, 2013, 342 (6164) :1337-1342
[6]   Thresholds for Epidemic Spreading in Networks [J].
Castellano, Claudio ;
Pastor-Satorras, Romualdo .
PHYSICAL REVIEW LETTERS, 2010, 105 (21)
[7]   The Spread of Behavior in an Online Social Network Experiment [J].
Centola, Damon .
SCIENCE, 2010, 329 (5996) :1194-1197
[8]   Efficient immunization strategies for computer networks and populations [J].
Cohen, R ;
Havlin, S ;
ben-Avraham, D .
PHYSICAL REVIEW LETTERS, 2003, 91 (24)
[9]   Detecting rich-club ordering in complex networks [J].
Colizza, V ;
Flammini, A ;
Serrano, MA ;
Vespignani, A .
NATURE PHYSICS, 2006, 2 (02) :110-115
[10]   Finding influential nodes for integration in brain networks using optimal percolation theory [J].
Del Ferraro, Gino ;
Moreno, Andrea ;
Min, Byungjoon ;
Morone, Flaviano ;
Perez-Ramirez, Ursula ;
Perez-Cervera, Laura ;
Parra, Lucas C. ;
Holodny, Andrei ;
Canals, Santiago ;
Makse, Hernan A. .
NATURE COMMUNICATIONS, 2018, 9