Reconstruction of evolved dynamic networks from degree correlations
arXiv:1603.08812 · doi:10.1103/PhysRevE.93.062306
Abstract
We study the importance of local structural properties in networks which have been evolved for a power-law scaling in their Laplacian spectrum. To this end, the degree distribution, two-point degree correlations, and degree-dependent clustering are extracted from the evolved networks and used to construct random networks with the prescribed distributions. In the analysis of these reconstructed networks it turns out that the degree distribution alone is not sufficient to generate the spectral scaling and the degree-dependent clustering has only an indirect influence. The two-point correlations are found to be the dominant characteristic for the power-law scaling over a broader eigenvalue range.
arXiv comment9 pages, 8 figures
References in corpus (23)
- Statistical mechanics of complex networks
- Assortative mixing in networks
- Random graphs with arbitrary degree distributions and their applications
- Synchronization in complex networks
- Evolution of networks
- Mixing patterns in networks
- Large-scale topological and dynamical properties of Internet
- Entangled networks, synchronization, and optimal network topology
- Topological Evolution of Dynamical Networks: Global Criticality from Local Dynamics
- Tuning clustering in random networks with arbitrary degree distributions
- Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
- Evolutionary reconstruction of networks
- Network synchronization: Spectral versus statistical properties
- Dynamical and spectral properties of complex networks
- Collective Relaxation Dynamics of Small-World Networks
- Generation of arbitrarily two-point correlated random networks
- Efficient Rewirings for Enhancing Synchronizability of Dynamical Networks
- Equitable random graphs
- Generating random networks with given degree-degree correlations and degree-dependent clustering
- Assortative and disassortative mixing investigated using the spectra of graphs
- Network evolution towards optimal dynamical performance
- Symmetry-based coarse-graining of evolved dynamical networks
- Random Walks on Complex Networks