EconPapers    
Economics at your fingertips  
 

Range changeable local structural information of nodes in complex networks

Meizhu Li, Minghao Zhou, Deyue Feng and Qi Zhang
Additional contact information
Meizhu Li: School of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang, Jiangsu 212013, P. R. China
Minghao Zhou: School of Science, Jiangsu University of Science and Technology, Zhenjiang 212100, P. R. China
Deyue Feng: School of Science, Jiangsu University of Science and Technology, Zhenjiang 212100, P. R. China
Qi Zhang: School of Science, Jiangsu University of Science and Technology, Zhenjiang 212100, P. R. China3Lorentz Institute for Theoretical Physics, Leiden University, P. O. Box 9504, 2300 RA Leiden, The Netherlands

International Journal of Modern Physics C (IJMPC), 2024, vol. 35, issue 01, 1-24

Abstract: In the research of complex networks, structural analysis can be explained as finding the information hidden in the network’s topological structure. Thus, the way and the range of the structural information collection decide what kinds of information can be found in the structural analysis. In this work, based on the definition of Shannon entropy and the changeable range of structural information collecting (changeable local network for each node), the local structural information (LSI) of nodes in complex networks is proposed. According to the definition, when the range of the local network converges to the node itself, the LSI is their original structural properties, e.g. node’s degree, betweenness and clustering coefficient, but when the range of the local network extends to the whole network (order of the local network equal to the diameter of networks), the LSI is equivalent to the structural entropy of the entire static network, e.g. degree structural entropy, betweenness structural entropy. We also find that the local degree structural information can be used to classify the nodes in the network, and the proportion of the “bridge†nodes in the network is a new indicator of the network’s robustness, the bigger this proportion of bridge nodes in the network, the more robust the network. This finding also explains why the regular networks or the lattice is so stable, as almost all the nodes in those systems are the “bridge†nodes that are identified by the local degree structural information.

Keywords: Local structural information; complex networks (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183124500062
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:35:y:2024:i:01:n:s0129183124500062

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183124500062

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().

 
Page updated 2025-03-20
Handle: RePEc:wsi:ijmpcx:v:35:y:2024:i:01:n:s0129183124500062