We propose a new measure to characterize the dimension of complex networks based on the ergodic theory of dynamical systems. This measure is derived from the correlation sum of a trajectory generated by a random walker navigating the network, and extends the classical Grassberger-Procaccia algorithm to the context of complex networks. The method is validated with reliable results for both synthetic networks and real-world networks such as the world air-transportation network or urban networks, and provides a computationally fast way for estimating the dimensionality of networks which only relies on the local information provided by the walkers
If a dynamic system can be driven from any initial state to any desired state in finite time by appl...
Complex systems and relational data are often abstracted as dynamical processes on networks. To unde...
In this paper we consider the concept of `closeness' between nodes in a weighted network that can be...
We propose a new measure to characterize the dimension of complex networks based on the ergodic theo...
In this article we address the concept of correlation dimension which has been recently extended to ...
Fractal and self-similarity are important characteristics of complex networks. The correlation dimen...
AbstractLarge complex networks occur in many applications of computer science. The complex network z...
BACKGROUND: Networks or graphs play an important role in the biological sciences. Protein interactio...
We present a novel way to characterize the structure of complex networks by studying the statistical...
Previous efforts in complex networks research focused mainly on the topological features of such net...
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal n...
An increasing number of network metrics have been applied in network analysis. If metric relations w...
Complex networks exist in many areas of science such as biology, neuroscience, engineering, and soci...
A statistical physics perspective of complex networks: from the architecture of the Internet and the...
We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach...
If a dynamic system can be driven from any initial state to any desired state in finite time by appl...
Complex systems and relational data are often abstracted as dynamical processes on networks. To unde...
In this paper we consider the concept of `closeness' between nodes in a weighted network that can be...
We propose a new measure to characterize the dimension of complex networks based on the ergodic theo...
In this article we address the concept of correlation dimension which has been recently extended to ...
Fractal and self-similarity are important characteristics of complex networks. The correlation dimen...
AbstractLarge complex networks occur in many applications of computer science. The complex network z...
BACKGROUND: Networks or graphs play an important role in the biological sciences. Protein interactio...
We present a novel way to characterize the structure of complex networks by studying the statistical...
Previous efforts in complex networks research focused mainly on the topological features of such net...
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal n...
An increasing number of network metrics have been applied in network analysis. If metric relations w...
Complex networks exist in many areas of science such as biology, neuroscience, engineering, and soci...
A statistical physics perspective of complex networks: from the architecture of the Internet and the...
We propose a fluctuation analysis to quantify spatial correlations in complex networks. The approach...
If a dynamic system can be driven from any initial state to any desired state in finite time by appl...
Complex systems and relational data are often abstracted as dynamical processes on networks. To unde...
In this paper we consider the concept of `closeness' between nodes in a weighted network that can be...