Symmetry-based coarse-graining of evolved dynamical networks
arXiv:1503.02446 · doi:10.1209/0295-5075/111/38003
Abstract
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are evolved to exhibit subdiffusive dynamics. Under the additional constraint of degree-regularity, the evolved networks display an abundance of symmetric motifs arranged into loops and long linear segments. Exploiting results from algebraic graph theory on symmetric networks, we find the underlying backbone structures and how they contribute to the spectrum. The resulting coarse-grained networks provide an intuitive view of how the anomalous diffusive properties can be realized in the evolved structures.
6 pages, 5 figures
References in corpus (16)
- Synchronization in complex networks
- Critical phenomena in complex networks
- Adaptive Coevolutionary Networks: A Review
- Scaling theory of transport 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
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Spectral Characteristics of Network Redundancy
- Efficient Rewirings for Enhancing Synchronizability of Dynamical Networks
- The effect of scale-free topology on the robustness and evolvability of genetic regulatory networks
- Bounding network spectra for network design
- Network synchronization: Optimal and Pessimal Scale-Free Topologies
- Reliability of genetic networks is evolvable
- Dynamics-Driven Evolution to Structural Heterogeneity in Complex Networks
- Network evolution towards optimal dynamical performance
- Random Walks on Complex Networks