Networks with many structural scales: a Renormalization Group perspective
arXiv:2406.19104 · doi:10.1103/PhysRevLett.134.057401
Abstract
Scale invariance profoundly influences the dynamics and structure of complex systems, spanning from critical phenomena to network architecture. Here, we propose a precise definition of scale-invariant networks by leveraging the concept of a constant entropy-loss rate across scales in a renormalization-group coarse-graining setting. This framework enables us to differentiate between scale-free and scale-invariant networks, revealing distinct characteristics within each class. Furthermore, we offer a comprehensive inventory of genuinely scale-invariant networks, both natural and artificially constructed, demonstrating, e.g., that the human connectome exhibits notable features of scale invariance. Our findings open new avenues for exploring the scale-invariant structural properties crucial in biological and socio-technological systems.
6 pages, 3 figures and Supplemental Material
References in corpus (36)
- The structure and function of complex networks
- Power-law distributions in empirical data
- Power laws, Pareto distributions and Zipf's law
- Self-similarity of complex networks
- Growing Scale-Free Networks with Tunable Clustering
- Scale-free networks are rare
- Synchronization reveals topological scales in complex networks
- Universality classes in nonequilibrium lattice systems
- Scale-Free Networks are Ultrasmall
- Colloquium: Criticality and dynamical scaling in living systems
- Pseudofractal Scale-free Web
- Griffiths phases and the stretching of criticality in brain networks
- Detecting Network Communities: a new systematic and efficient algorithm
- Entangled networks, synchronization, and optimal network topology
- Self-similarity of complex networks and hidden metric spaces
- Spectra of complex networks
- Fractal and Transfractal Recursive Scale-Free Nets
- Random walks on graphs: ideas, techniques and results
- Statistical ensemble of scale-free random graphs
- Spectral entropies as information-theoretic tools for complex network comparison
- Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
- Spectral coarse-graining of complex networks
- Multiscale unfolding of real networks by geometric renormalization
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Geometric renormalization unravels self-similarity of the multiscale human connectome
- True scale-free networks hidden by finite size effects
- Complex networks renormalization: flows and fixed points
- Evolution of a Modular Software Network
- The spectral dimension of random trees
- Laplacian paths in complex networks: information core emerges from entropic transitions
- Explicit construction of the eigenvectors and eigenvalues of the graph Laplacian on the Cayley tree
- Scaling laws for diffusion on (trans)fractal scale-free networks
- Evolution in the Debian GNU/Linux software network: analogies and differences with gene regulatory networks
- Multi-scale Laplacian community detection in heterogeneous networks
- The statistical geometry of scale-free random trees
- Laplacian Renormalization Group: An introduction to heterogeneous coarse-graining
Cited by in corpus (8)
- Network Renormalization
- Strange Attractors in Complex Networks
- Topological protection breakdown: a route to frustrated ferroelectricity
- Global decomposition of networks into multiple cores formed by local hubs
- From Spatial to Spectral: Network Renormalization via Dynamical Correlations
- Higher-order contagion processes in 3.99 dimensions
- Geometric Criticality in Scale-Invariant Networks
- Asymptotic versus mesoscopic spectral dimensions in networks and inhomogeneous structures