[HTML][HTML] A new information dimension of complex networks

D Wei, B Wei, Y Hu, H Zhang, Y Deng - Physics Letters A, 2014 - Elsevier
The fractal and self-similarity properties are revealed in many complex networks. The
classical information dimension is an important method to study fractal and self-similarity …

An information dimension of weighted complex networks

T Wen, W Jiang - Physica A: Statistical Mechanics and its Applications, 2018 - Elsevier
The fractal and self-similarity are important properties in complex networks. Information
dimension is a useful dimension for complex networks to reveal these properties. In this …

A generalized volume dimension of complex networks

D Wei, B Wei, H Zhang, C Gao… - Journal of Statistical …, 2014 - iopscience.iop.org
The fractal and self-similarity properties are investigated in many real complex networks.
The volume dimension method is an effective tool to measure the fractal property of complex …

Multifractality of weighted complex networks

D Wei, X Chen, Y Deng - Chinese Journal of Physics, 2016 - Elsevier
The multifractality property of many complex networks have been investigated. However,
existing researches mainly revealed the multifractality of unweighted networks. In this paper …

Self-similarity in complex networks: from the view of the hub repulsion

H Zhang, X Lan, D Wei, S Mahadevan… - Modern Physics Letters …, 2013 - World Scientific
Complex networks are widely used to model the structure of many complex systems in
nature and society. Recently, fractal and self-similarity of complex networks have attracted …

[HTML][HTML] Box-covering algorithm for fractal dimension of weighted networks

DJ Wei, Q Liu, HX Zhang, Y Hu, Y Deng… - Scientific reports, 2013 - nature.com
Box-covering algorithm is a widely used method to measure the fractal dimension of
complex networks. Existing researches mainly deal with the fractal dimension of unweighted …

Accuracy of the ball-covering approach for fractal dimensions of complex networks and a rank-driven algorithm

L Gao, Y Hu, Z Di - Physical Review E, 2008 - APS
Minimum box-covering method is a basic tool to measure fractal dimension of a network but
unfortunately belongs to a family of N P-hard problems. Finding more accurate …

Overlapping-box-covering method for the fractal dimension of complex networks

Y Sun, Y Zhao - Physical Review E, 2014 - APS
The fractality and self-similarity of complex networks have been widely investigated by
evaluating the fractal dimension, the crux of which is how to locate the optimal solution or …

A cluster-growing dimension of complex networks: From the view of node closeness centrality

B Wei, Y Deng - Physica A: Statistical Mechanics and its Applications, 2019 - Elsevier
The cluster-growing method has been widely used to measure the fractal dimension of
complex networks. In this method, a seed node is chosen at random and the number of …

The self-similarity of complex networks: From the view of degree–degree distance

B Wang, J Zhu, D Wei - Modern Physics Letters B, 2021 - World Scientific
Self-similarity of complex networks has been discovered and attracted much attention.
However, the self-similarity of complex networks was measured by the classical distance of …