Origins of fractality in the growth of complex networks

  title={Origins of fractality in the growth of complex networks},
  author={Chaoming Song and Shlomo Havlin and Hern{\'a}n A. Makse},
  journal={Nature Physics},
Complex networks from such different fields as biology, technology or sociology share similar organization principles. The possibility of a unique growth mechanism promises to uncover universal origins of collective behaviour. In particular, the emergence of self-similarity in complex networks raises the fundamental question of the growth process according to which these structures evolve. Here we investigate the concept of renormalization as a mechanism for the growth of fractal and non… 
The Fractal Dimensions of Complex Networks
This work finds that the average 'density' (ρ(r)) of complex networks follows a better power-law function as a function of distance r with the exponent df, which is defined as the fractal dimension, in some real complex networks.
Small-world to fractal transition in complex networks: a renormalization group approach.
It is shown that renormalization group (RG) theory applied to complex networks is useful to classify network topologies into universality classes in the space of configurations and allows us to extract information on the distribution of shortcuts in real-world networks.
Role of fractal dimension in random walks on scale-free networks
This paper derives analytically the average trapping time for random walks on both the (x,y)-flowers and the hybrid networks with an immobile trap positioned at an initial node, i.e., a hub node with the highest degree in the networks.
Fractal and Transfractal Scale-Free Networks
The recent advances in self-similarity of complex networks and its relation to transport, diffusion, percolations and other topological properties such us degree distribution, modularity, and degree-degree correlations are reviewed.
A key heterogeneous structure of fractal networks based on inverse renormalization scheme
A general model of hierarchical fractal scale-free networks
A general model of unweighted and undirected networks having the scale-free property and fractal nature is proposed, which makes it possible to elucidate how a specific structural property influences a phenomenon occurring on FSFNs by varying systematically the structures of FSFN.


Complex systems: Romanesque networks
A new analysis of ‘Scale-free’ networks, in which nodes are partitioned into boxes of different sizes, reveals that they share the surprising feature of self-similarity, which may help explain how the scale-free property of such networks arises.
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.
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.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Geometric fractal growth model for scale-free networks.
  • S. Jung, S. Kim, B. Kahng
  • Mathematics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2002
A deterministic model for scale-free networks, whose degree distribution follows a power law with the exponent gamma, and the case that the number of offspring is the same for all vertices, finds that the degree distribution exhibits an exponential-decay behavior.
Specificity and Stability in Topology of Protein Networks
It is found that for both interaction and regulatory networks, links between highly connected proteins are systematically suppressed, whereas those between a highly connected and low-connected pairs of proteins are favored.
The large-scale organization of metabolic networks
This analysis of metabolic networks of 43 organisms representing all three domains of life shows that, despite significant variation in their individual constituents and pathways, these metabolic networks have the same topological scaling properties and show striking similarities to the inherent organization of complex non-biological systems.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
This paper introduces a structural metric that allows us to differentiate between all simple, connected graphs having an identical degree sequence, which is of particular interest when that sequence satisfies a power law relationship.