From Spatial to Spectral: Network Renormalization via Dynamical Correlations
Cook Hyun Kim, B. Kahng

TL;DR
This paper introduces a spectral-space network renormalization method based on dynamical correlations, enabling the analysis of complex systems' organizational structures and failure pathways beyond traditional adjacency-based approaches.
Contribution
It develops a novel spectral renormalization framework and meta-graph algorithm that preserve dynamical coherence, revealing hidden structures and correlations in diverse networks.
Findings
Uncovers long-range dynamical correlations in networks.
Extracts consistent fractal and spectral dimensions across systems.
Reveals hidden failure pathways in power grids.
Abstract
Network renormalization has traditionally relied on spatial adjacency-grouping nearby nodes together, but this approach fails to capture the dynamical correlations that govern system-wide behavior in scale-free networks. We present a spectral-space renormalization framework that enables coarse-graining based on dynamical coherence rather than geometric proximity. Within this framework, diffusion processes naturally constitute renormalization transformations in spectral space, yielding scaling relations that connect network dimensions with critical exponents. Building on this foundation, we develop a meta-graph reconstruction algorithm that systematically maps spectral information back into explicit topology while preserving dynamical correlations. The resulting renormalized networks uncover organizational structures that remain invisible to adjacency-based methods, including long-range…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
