Network synchronizability analysis: the theory of subgraphs and complementary graphs
arXiv:0708.0660 · doi:10.1016/j.physd.2007.12.003
Abstract
In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which characterizes the network synchronizability, especially when the network's corresponding graph has cycles, chains, bipartite graphs or product graphs as its subgraphs.
13 pages, 7 figures
References in corpus (14)
- Synchronization in small-world systems
- Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
- Pinning-controllability of complex networks
- Entangled networks, synchronization, and optimal network topology
- Enhancing complex-network synchronization
- Factors that predict better synchronizability on complex networks
- Vertex overload breakdown in evolving networks
- Edge overload breakdown in evolving networks
- Maximum Performance at Minimum Cost in Network Synchronization
- Network synchronization: Spectral versus statistical properties
- Relations between Average Distance, Heterogeneity and Network Synchronizability
- Ensemble averageability in network spectra
- Bounding network spectra for network design
- Analysis and control of network synchronizability