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, \'a la Wilson, and applying this RG scheme to real networks in a natural and parsimonious way.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.