Analysis and evaluation of the entropy indices of a static network structure

被引:41
作者
Cai, Meng [1 ,3 ,4 ]
Cui, Ying [2 ,3 ,4 ]
Stanley, H. Eugene [3 ,4 ]
机构
[1] Xidian Univ, Sch Econ & Management, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Sch Mechanoelect Engn, Xian 710071, Shaanxi, Peoples R China
[3] Boston Univ, Ctr Polymer Studies, Boston, MA 02215 USA
[4] Boston Univ, Dept Phys, 590 Commonwealth Ave, Boston, MA 02215 USA
来源
SCIENTIFIC REPORTS | 2017年 / 7卷
基金
中国国家自然科学基金;
关键词
D O I
10.1038/s41598-017-09475-9
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Although degree distribution entropy (DDE), SD structure entropy (SDSE), Wu structure entropy (WSE) and FB structure entropy (FBSE) are four static network structure entropy indices widely used to quantify the heterogeneity of a complex network, previous studies have paid little attention to their differing abilities to describe network structure. We calculate these four structure entropies for four benchmark networks and compare the results by measuring the ability of each index to characterize network heterogeneity. We find that SDSE and FBSE more accurately characterize network heterogeneity than WSE and DDE. We also find that existing benchmark networks fail to distinguish SDSE and FBSE because they cannot discriminate local and global network heterogeneity. We solve this problem by proposing an evolving caveman network that reveals the differences between structure entropy indices by comparing the sensitivities during the network evolutionary process. Mathematical analysis and computational simulation both indicate that FBSE describes the global topology variation in the evolutionary process of a caveman network, and that the other three structure entropy indices reflect only local network heterogeneity. Our study offers an expansive view of the structural complexity of networks and expands our understanding of complex network behavior.
引用
收藏
页数:10
相关论文
共 22 条
[1]  
[Anonymous], COMPLEX NETWORKS 4
[2]  
[Anonymous], 1999, Small Worlds. The Dynamics of Networks Between Order and Randomness
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   A graph-theoretic perspective on centrality [J].
Borgatti, Stephen P. ;
Everett, Martin G. .
SOCIAL NETWORKS, 2006, 28 (04) :466-484
[5]   A new network structure entropy based on maximum flow [J].
Cai Meng ;
Du Hai-Feng ;
Feldman, Marcus W. .
ACTA PHYSICA SINICA, 2014, 63 (06)
[6]   A new network structure entropy based node difference and edge difference [J].
Cai Meng ;
Du Hai-Feng ;
Ren Yi-Ke ;
Feldman, Marcus W. .
ACTA PHYSICA SINICA, 2011, 60 (11)
[7]   Universal resilience patterns in complex networks [J].
Gao, Jianxi ;
Barzel, Baruch ;
Barabasi, Albert-Laszlo .
NATURE, 2016, 530 (7590) :307-312
[8]   Network Entropy Based on Topology Configuration and Its Computation to Random Networks [J].
Li Ji ;
Wang Bing-Hong ;
Wang Wen-Xu ;
Zhou Tao .
CHINESE PHYSICS LETTERS, 2008, 25 (11) :4177-4180
[9]   Structure and bias in the network autocorrelation model [J].
Neuman, Eric J. ;
Mizruchi, Mark S. .
SOCIAL NETWORKS, 2010, 32 (04) :290-300
[10]   Epidemic processes in complex networks [J].
Pastor-Satorras, Romualdo ;
Castellano, Claudio ;
Van Mieghem, Piet ;
Vespignani, Alessandro .
REVIEWS OF MODERN PHYSICS, 2015, 87 (03) :925-979