Analytical estimation of the correlation dimension of integer lattices

Abstract

Recently [L. Lacasa and J. Gómez-Gardeñes, Phys. Rev. Lett. {\bf 110}, 168703 (2013)], a fractal dimension has been proposed to characterize the geometric structure of networks. This measure is an extension to graphs of the so called {\em correlation dimension}, originally proposed by Grassberger and Procaccia to describe the geometry of strange attractors in dissipative chaotic systems. The calculation of the correlation dimension of a graph is based on the local information retrieved from a random walker navigating the network. In this contribution we study such quantity for some limiting synthetic spatial networks and obtain analytical results on agreement with the previously reported numerics. In particular, we show that up to first order the correlation dimension $\beta$ of integer lattices ${\mathbb{Z}}^d$ coincides with the Haussdorf dimension of their coarsely-equivalent Euclidean spaces, $\beta =d$.

arXiv commentShort article, submitted for publication

References in corpus (15)

• Statistical mechanics of complex networks
• The structure and function of complex networks
• Maps of random walks on complex networks reveal community structure
• Self-similarity of complex networks
• Popularity versus Similarity in Growing Networks
• Origins of fractality in the growth of complex networks
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Self-similarity of complex networks and hidden metric spaces
• The entropy of randomized network ensembles
• Entropy Rate of Diffusion Processes on Complex Networks
• Mean field solution of the Ising model on a Barabasi-Albert network
• Langevin approach for the dynamics of the contact process on annealed scale-free networks
• Correlation dimension of complex networks
• Annealed and Mean-Field formulations of Disease Dynamics on Static and Adaptive Networks
• Effective dimensions and percolation in hierarchically structured scale-free networks