Measure for degree heterogeneity in complex networks and its application to recurrence network analysis.

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 [Formula: see text]. 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 tends to infinity. We numerically study the variation of heterogeneity for random graphs (as a function of and ) and for SF networks with and 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.