Finite-size scaling of geometric renormalization flows in complex networks
arXiv:2001.09875 · doi:10.1103/PhysRevE.104.034304
Abstract
Recently, the concept of geometric renormalization group provides a good approach for studying the structural symmetry and functional invariance of complex networks. Along this line, we systematically investigate the finite-size scaling of structural and dynamical observables in geometric renormalization flows of synthetic and real evolutionary networks. Our results show that these observables can be well characterized by a certain scaling function. Specifically, we show that the critical exponent implied by the scaling function is independent of these observables but only depends on the small-world properties of the network, namely, all networks located in the small-world phase have a uniform scaling exponent, while those located in the non-small-world phase and in their critical regions have another uniform scaling. More importantly, we perform extensive experiments on real evolutionary networks with small-world characteristics, and our results show that these observables also have uniform scaling in their geometric renormalization flows. Therefore, in a sense this exponent can be used as an effective measure for classifying universal small-world and non-small-world network models.
References in corpus (37)
- Emergence of scaling in random networks
- The structure of scientific collaboration networks
- Synchronization in complex networks
- Synchronization in small-world systems
- Self-similarity of complex networks
- Renormalization group analysis of the small-world network model
- Hyperbolic Geometry of Complex Networks
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
- Popularity versus Similarity in Growing Networks
- Origins of fractality in the growth of complex networks
- Sustaining the Internet with Hyperbolic Mapping
- How to calculate the fractal dimension of a complex network: the box covering algorithm
- Entangled networks, synchronization, and optimal network topology
- Self-similarity of complex networks and hidden metric spaces
- The onset of synchronization in large networks of coupled oscillators
- Remote synchronization reveals network symmetries and functional modules
- Synchronization is optimal in non-diagonalizable networks
- Skeleton and fractal scaling in complex networks
- Designing optimal transport networks
- Small world-Fractal Transition in Complex Networks: Renormalization Group Approach
- Observability and Controllability of Nonlinear Networks: The Role of Symmetry
- Maximum Performance at Minimum Cost in Network Synchronization
- Spectral coarse-graining of complex networks
- Fractality in complex networks: critical and supercritical skeletons
- Low-temperature behavior of two-dimensional Gaussian Ising spin glasses
- Curvature and temperature of complex networks
- Multiscale unfolding of real networks by geometric renormalization
- The hidden geometry of weighted complex networks
- Anomalous Transport in Complex Networks
- True scale-free networks hidden by finite size effects
- Complex networks renormalization: flows and fixed points
- Relating Topological Determinants of Complex Networks to Their Spectral Properties: Structural and Dynamical Effects
- Geographical Coarsegraining of Complex Networks
- Renormalization flows in complex networks
- Optimal Synchronization in Space
- Sensitive Dependence of Optimal Network Dynamics on Network Structure