TY - JOUR
T1 - Undirected Congruence Model
T2 - Topological characteristics and epidemic spreading
AU - Li, Yinwei
AU - Jiang, Guo Ping
AU - Wu, Meng
AU - Song, Yu Rong
AU - Wang, Haiyan
N1 - Funding Information:
The authors would like to thank Prof. Guanrong Chen from The City University of Hong Kong for helpful discussions with him! Yinwei Li, Guo-Ping Jiang, and Yu-Rong Song were supported by the National Natural Science Foundation of China (Grant Nos. 61672298 , 61873326 , 61802155 , 61802201 , and 61971240 ) and the Philosophy Social Science Research Key Project Fund of Jiangsu University, PR China (Grant No. 2018SJZDI142 ).
Funding Information:
The authors would like to thank Prof. Guanrong Chen from The City University of Hong Kong for helpful discussions with him! Yinwei Li, Guo-Ping Jiang, and Yu-Rong Song were supported by the National Natural Science Foundation of China (Grant Nos. 61672298, 61873326, 61802155, 61802201, and 61971240) and the Philosophy Social Science Research Key Project Fund of Jiangsu University, PR China (Grant No. 2018SJZDI142).
Publisher Copyright:
© 2020
PY - 2021/3/1
Y1 - 2021/3/1
N2 - In this paper, we investigate the topological characteristics of an undirected congruence network and the ability of the network against epidemic spreading. First, we construct a model of undirected congruence network and analyze its topological characteristics and deduce the upper bounds for the diameter and average path length respectively. We find that the undirected congruence network exhibits a likely power-law degree distribution. Then, we study the ability of the undirected congruence network against epidemic spreading by comparing it with other networks that are generated from the undirected congruence network by the degree-preserving rewiring algorithm. Our simulation results show that the undirected congruence network has a stronger ability to reduce the epidemic outbreaks than other networks. In particular, we find that the average size of the connected components of the attacked undirected congruence network is far larger than that of other attacked networks, which reveals that the cost of recovering the attacked undirected congruence network is far less than the other networks. Our study gains insight into the design of complex networks against epidemic spreading.
AB - In this paper, we investigate the topological characteristics of an undirected congruence network and the ability of the network against epidemic spreading. First, we construct a model of undirected congruence network and analyze its topological characteristics and deduce the upper bounds for the diameter and average path length respectively. We find that the undirected congruence network exhibits a likely power-law degree distribution. Then, we study the ability of the undirected congruence network against epidemic spreading by comparing it with other networks that are generated from the undirected congruence network by the degree-preserving rewiring algorithm. Our simulation results show that the undirected congruence network has a stronger ability to reduce the epidemic outbreaks than other networks. In particular, we find that the average size of the connected components of the attacked undirected congruence network is far larger than that of other attacked networks, which reveals that the cost of recovering the attacked undirected congruence network is far less than the other networks. Our study gains insight into the design of complex networks against epidemic spreading.
KW - Complex network
KW - Epidemic spreading
KW - Topological characteristics
KW - Undirected congruence network
UR - http://www.scopus.com/inward/record.url?scp=85097351543&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85097351543&partnerID=8YFLogxK
U2 - 10.1016/j.physa.2020.125610
DO - 10.1016/j.physa.2020.125610
M3 - Article
AN - SCOPUS:85097351543
VL - 565
JO - Physica A: Statistical Mechanics and its Applications
JF - Physica A: Statistical Mechanics and its Applications
SN - 0378-4371
M1 - 125610
ER -