Reconstruction of evolved dynamic networks from degree correlations

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.

9 pages, 8 figures

References in corpus (13)

• Synchronization in complex networks
• Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?
• 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