Complexity of networks: A structural heterogeneity approach

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...

Full description

Saved in:
Bibliographic Details
Published in:Europhysics letters 2023-08, Vol.143 (3), p.31001
Main Authors: Liu, Gang, Tian, Tian, Huang, Chengfu, Mou, Biao
Format: Article
Language:English
Subjects:
Complexity
Heterogeneity
Measurement methods
Social networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0295-5075
1286-4854
DOI:10.1209/0295-5075/ace6ce