Correlation between the electrical transport performance and the communicability sequence entropy in complex networks

被引:6
作者
Chen Dan [1 ]
Shi Dan-Dan [1 ]
Pan Gui-Jun [1 ]
机构
[1] Hubei Univ, Fac Phys & Elect Sci, Wuhan 430062, Hubei, Peoples R China
关键词
complex network; electrical transport performance; communicability sequence entropy; positive correlation; SMALL-WORLD;
D O I
10.7498/aps.68.20190230
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Optimization of the network' s electrical transport properties not only conduces to understanding the relationship between structure and network function, but also can improve the electrical engineering technology. The effective way to solve this problem is to treat the network from the information viewpoint and seek the information structure measure which affects crucially the network electrical transport performance. Recent studies have shown that the communicability sequence entropy of complex networks can effectively quantify the global structural information of networks. Based on this measure, the difference between networks can be quantified effectively, and the connotation of communicability sequence entropy is explained. In this paper, we predict that the electrical transport performance of complex networks has a strong correlation with the communicability sequence entropy. For this reason, we mainly study the correlation characteristics of the electrical transport performance and communicability sequence entropy of small-world networks, scale-free networks, degree-correlated scale-free networks, community networks, and IEEE57 and other electrical node networks. The results show that the electrical transport performances of these networks are all a monotonically increasing function of communicability sequence entropy, namely, the communicability sequence entropy, and the electrical transport properties have a positive correlation. Specifically, in the process evolving from a regular network to a small-world network, the communicability sequence entropy and electrical transport performance of the network increase gradually. For scale-free networks, in the process of increasing degree distribution exponent, communicability sequence entropy and electrical transport performance of the network increase gradually. For degree-correlated scale-free networks, during the evolution from assortative to dis assortative topology, communicability sequence entropy and electrical transport performance both decrease gradually. For networks with community structure, the communicability sequence entropy and electrical transport performance decrease with the increase of the number of communities. Finally, the correlation between communicability sequence entropy and electrical transport performance of two classical node power supply networks and corresponding randomization network models are also studied. The results show that as the order of d increases, both communicability sequence entropy and electrical transport performance decrease. And both are getting closer to the original network's communicability sequence entropy and electrical transport performance. The rule is beneficial to providing an effective strategy for designing a high transmission efficiency of the power network, that is, we can optimize the electrical transport performance by improving the network communicability sequence entropy.
引用
收藏
页数:10
相关论文
共 42 条
[1]   Statistical mechanics of complex networks [J].
Albert, R ;
Barabási, AL .
REVIEWS OF MODERN PHYSICS, 2002, 74 (01) :47-97
[2]  
[Anonymous], EVOLUTION NETWORKS B
[3]  
[Anonymous], COMPLEX NETWORKS STR
[4]  
[Anonymous], NETWORKS INTRO
[5]   Distributed flow optimization and cascading effects in weighted complex networks [J].
Asztalos, A. ;
Sreenivasan, S. ;
Szymanski, B. K. ;
Korniss, G. .
EUROPEAN PHYSICAL JOURNAL B, 2012, 85 (08)
[6]   Effect of connection on transport between scale free networks [J].
Baba, A. Ould ;
Bamaarouf, O. ;
Rachadi, A. ;
Ez-Zahraouy, H. .
INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2017, 28 (05)
[7]  
Barabasi A., 2016, Network Science, V1st, P5
[8]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[9]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[10]   The Laplacian of a graph as a density matrix: A basic combinatorial approach to separability of mixed states [J].
Braunstein, Samuel L. ;
Ghosh, Sibasish ;
Severini, Simone .
ANNALS OF COMBINATORICS, 2006, 10 (03) :291-317