Laplacian Renormalization Group for heterogeneous networks

Abstract

The renormalization group is the cornerstone of the modern theory of universality and phase transitions, a powerful tool to scrutinize symmetries and organizational scales in dynamical systems. However, its network counterpart is particularly challenging due to correlations between intertwined scales. To date, the explorations are based on hidden geometries hypotheses. Here, we propose a Laplacian RG diffusion-based picture in complex networks, defining both the Kadanoff supernodes' concept, the momentum space procedure, \emph{á la Wilson}, and applying this RG scheme to real networks in a natural and parsimonious way.

7 pages, 4 figures, and Supplementary Information

References in corpus (5)

• Spectral coarse-graining of complex networks
• Complex networks renormalization: flows and fixed points
• The spectral dimension of simplicial complexes: a renormalization group theory
• Laplacian paths in complex networks: information core emerges from entropic transitions
• Renormalization group and diffusion equation

Cited by in corpus (4)

• Generalized network density matrices for analysis of multiscale functional diversity
• Multi-scale Laplacian community detection in heterogeneous networks
• Phase transitions in in vivo or in vitro populations of spiking neurons belong to different universality classes
• Inhomogeneous random graphs with infinite-mean fitness variables