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 (9)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Hierarchical Organization in Complex Networks
• Self-similarity of complex networks
• Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
• Origins of fractality in the growth of complex networks
• How to calculate the fractal dimension of a complex network: the box covering algorithm
• Skeleton and fractal scaling in complex networks

Cited by in corpus (33)

• A small-world of weak ties provides optimal global integration of self-similar modules in functional brain networks
• Network Geometry
• Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
• Multiscale unfolding of real networks by geometric renormalization
• Feigenbaum graphs: a complex network perspective of chaos
• Self-similar scaling of density in complex real-world networks
• Laplacian Renormalization Group for heterogeneous networks
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Weighted Fractal Networks
• Renormalization flows in complex networks
• q-state Potts model on the Apollonian network
• The nature and nurture of network evolution
• Dynamics and Processing in Finite Self-Similar Networks
• Information content: assessing meso-scale structures in complex networks
• Scaling theory of fractal complex networks
• Optimal high-level descriptions of dynamical systems
• A unified data representation theory for network visualization, ordering and coarse-graining
• Statistically consistent coarse-grained simulations for critical phenomena in complex networks
• Random elastic networks : strong disorder renormalization approach
• Irreversible Aggregation and Network Renormalization
• Random Sequential Renormalization of Networks I: Application to Critical Trees
• Networks with many structural scales: a Renormalization Group perspective
• Network Renormalization
• Finite-size scaling of geometric renormalization flows in complex networks
• Random Sequential Renormalization and Agglomerative Percolation in Networks: Application to Erd"os-R'enyi and Scale-free Graphs
• Scaling properties of scale-free networks in degree-thresholding renormalization flows
• Coarse-grained Monte Carlo simulations of the phase transition of Potts model on weighted networks
• Model-based reconstruction of real-world fractal complex networks
• Latent geometry emerging from network-driven processes
• The conundrum of functional brain networks: small-world efficiency or fractal modularity
• Chaotic renormalization group flow and entropy gradients over Haros graphs
• Virus and Warning Spread in Dynamical Networks
• Universal scaling hypothesis of quantum spatial search in complex networks