Complex networks renormalization: flows and fixed points

Abstract

Recently, it has been claimed that some complex networks are self-similar under a convenient renormalization procedure. We present a general method to study renormalization flows in graphs. We find that the behavior of some variables under renormalization, such as the maximum number of connections of a node, obeys simple scaling laws, characterized by critical exponents. This is true for any class of graphs, from random to scale-free networks, from lattices to hierarchical graphs. Therefore, renormalization flows for graphs are similar as in the renormalization of spin systems. An analysis of classic renormalization for percolation and the Ising model on the lattice confirms this analogy. Critical exponents and scaling functions can be used to classify graphs in universality classes, and to uncover similarities between graphs that are inaccessible to a standard analysis.

4 pages, 4 figures. Final version published on Physical Review Letters

References in corpus (1)

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

Cited by in corpus (6)

• Renormalization flows in complex networks
• q-state Potts model on the Apollonian network
• Statistically consistent coarse-grained simulations for critical phenomena in complex networks
• Random elastic networks : strong disorder renormalization approach
• Random Sequential Renormalization of Networks I: Application to Critical Trees
• Virus and Warning Spread in Dynamical Networks