Volume 143, Number 3, August 2023
|Number of page(s)||7|
|Section||Statistical physics and networks|
|Published online||24 July 2023|
Complexity of networks: A structural heterogeneity approach
1 College of Earth Sciences, Chengdu University of Technology - Chengdu, China
2 State Key Laboratory of Geohazard Prevention and Geoenvironment Protection, Chengdu University of Technology Chengdu, China
(a) E-mail: email@example.com (corresponding author)
Received: 13 March 2023
Accepted: 12 July 2023
The complexity measurement of networks is one of the hot topics in complex networks. How to accurately describe the complexity difference between networks is helpful to the study of network structure. This paper proposes a method for measuring the network complexity considering the local and global structural heterogeneity. This method introduces the k-order neighbors to examine the local structural heterogeneity. Besides, the standard deviation is used to evaluate the global structural heterogeneity. Based on this, the complexity measurement model is established. In order to testify the efficiency of the method, the ER random networks, BA scale-free networks and real networks (including four social networks and two infrastructure networks) are used for experiments. The results show that the proposed method is sensitive and can effectively describe the subtle difference of structure complexity between networks.
© 2023 EPLA
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.