A new information dimension of complex networks
arXiv:1311.3527 · doi:10.1016/j.physleta.2014.02.010
Abstract
The fractal and self-similarity properties are revealed in many real complex networks. However, the classical information dimension of complex networks is not practical for real complex networks. In this paper, a new information dimension to characterize the dimension of complex networks is proposed. The difference of information for each box in the box-covering algorithm of complex networks is considered by this measure. The proposed method is applied to calculate the fractal dimensions of some real networks. Our results show that the proposed method is efficient for fractal dimension of complex networks.
14 pages, 2 figures
References in corpus (6)
- Effective and Efficient Similarity Index for Link Prediction of Complex Networks
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Fractality in complex networks: critical and supercritical skeletons
- Multiscale Mixing Efficiencies for Steady Sources
- Controlling the efficiency of trapping in treelike fractals
- Origin of the hub spectral dimension in scale-free networks
Cited by in corpus (8)
- Detecting the ultra low dimensionality of real networks
- Tsallis information dimension of complex networks
- Multifractal Characterization of Protein Contact Networks
- A betweenness structure entropy of complex networks
- Measure the similarity of nodes in the complex networks
- Nonextensive analysis on the local structure entropy of complex networks
- Tsallis entropy of complex networks
- An improved vulnerability index of complex networks based on fractal dimension