Network synchronization: Optimal and Pessimal Scale-Free Topologies
arXiv:0710.4886 · doi:10.1088/1751-8113/41/22/224008
Abstract
By employing a recently introduced optimization algorithm we explicitely design optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency towards disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting ``pessimal networks'' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.
11 pages, 4 figs, submitted to J. Phys. A (proceedings of Complex Networks 2007)
References in corpus (10)
- Network Synchronization, Diffusion, and the Paradox of Heterogeneity
- Paths to Synchronization on Complex Networks
- Enhancing complex-network synchronization
- Synchronization is optimal in non-diagonalizable networks
- Synchronization in scale-free network with asymmetric coupling
- Synchronizability determined by coupling strengths and topology on Complex Networks
- Network synchronization: Spectral versus statistical properties
- Optimal network topologies: Expanders, Cages, Ramanujan graphs, Entangled networks and all that
- Synchronization in weighed scale-free networks with degree-degree correlation
- Bounding network spectra for network design