Analytical estimation of the correlation dimension of integer lattices.

  title={Analytical estimation of the correlation dimension of integer lattices.},
  author={Lucas Lacasa and Jes{\'u}s G{\'o}mez-Garde{\~n}es},
  volume={24 4},
Recently [L. Lacasa and J. Gómez-Gardeñes, Phys. Rev. Lett. 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 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… 

Figures from this paper

An Extended Correlation Dimension of Complex Networks

The correlation dimension is extended to the weighted networks and used to analyze the fractal properties of the Newman–Watts (NW) unweighted small-world networks.

The Correlation Dimension of a Rectilinear Grid

  • E. Rosenberg
  • Computer Science, Mathematics
    J. Interconnect. Networks
  • 2016
A simple “overall slope” definition for dC is proposed which satisfies two properties that should be satisfied by any definition of the correlation dimension of a network.

Network Correlation Dimension

In Sect. 9.2, we defined, for a geometric object Ω, the measure μ(Ω(x, r)) of the neighborhood Ω(x, r) of radius r centered at the point x ∈ Ω, and we defined the pointwise mass dimension

Cortical functional activity in patients with generalized anxiety disorder

The increased D2 values were found in the majority of cerebral regions in GAD patients, especially in the left cerebral regions and the right temporal lobe.

Fractal Dimensions of Networks

Generalized Hausdorff dimensions of a complex network

  • E. Rosenberg
  • Mathematics
    Physica A: Statistical Mechanics and its Applications
  • 2018



Origins of fractality in the growth of complex networks

It is shown that the key principle that gives rise to the fractal architecture of networks is a strong effective ‘repulsion’ (or, disassortativity) between the most connected nodes (that is, the hubs) on all length scales, rendering them very dispersed.

Langevin approach for the dynamics of the contact process on annealed scale-free networks.

This work presents a detailed analysis of the contact process in terms of a Langevin equation, including explicitly the effects of stochastic fluctuations in the number of particles in finite networks, and examines the survival time for spreading experiments and the density of active sites in surviving runs.

How to calculate the fractal dimension of a complex network: the box covering algorithm

It is argued that the algorithms presented provide a solution close to optimal and that another algorithm that can significantly improve this result in an efficient way does not exist.

Correlation dimension of complex networks

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.

Effective dimensions and percolation in hierarchically structured scale-free networks.

The dimensional characterization of this hierarchically structured network is in agreement with the results on statistics of site percolation and other dynamical processes implemented on such a network.

Statistical mechanics of complex networks

A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.

Self-similarity of complex networks and hidden metric spaces

These findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Maps of random walks on complex networks reveal community structure

An information theoretic approach is introduced that reveals community structure in weighted and directed networks of large-scale biological and social systems and reveals a directional pattern of citation from the applied fields to the basic sciences.

Self-similarity of complex networks

A power-law relation is identified between the number of boxes needed to cover the network and the size of the box, defining a finite self-similar exponent to explain the scale-free nature of complex networks and suggest a common self-organization dynamics.