Journal
ROYAL SOCIETY OPEN SCIENCE
Volume 4, Issue 1, Pages -Publisher
ROYAL SOC
DOI: 10.1098/rsos.160757
Keywords
complex networks; heterogeneity measure; recurrence network analysis
Categories
Funding
- Science and Engineering Research Board (SERB), Govt. of India [SR/S2/HEP-27/2012]
Ask authors/readers for more resources
We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all types of network topology with ease and increases with the diversity of node degrees in the network. The measure is applied to compute the heterogeneity of synthetic (both random and scale free (SF)) and real-world networks with its value normalized in the interval [0, 1]. To define the measure, we introduce a limiting network whose heterogeneity can be expressed analytically with the value tending to 1 as the size of the network N tends to infinity. We numerically study the variation of heterogeneity for random graphs (as a function of p and N) and for SF networks with. and N as variables. Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low-dimensional chaotic attractors, thereby providing a single index to compare the structural complexity of chaotic attractors.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available