Relations between Average Distance, Heterogeneity and Network Synchronizability
arXiv:cond-mat/0510332 · doi:10.1016/j.physa.2006.03.041
Abstract
By using the random interchanging algorithm, we investigate the relations between average distance, standard deviation of degree distribution and synchronizability of complex networks. We find that both increasing the average distance and magnifying the degree deviation will make the network synchronize harder. Only the combination of short average distance and small standard deviation of degree distribution that ensures strong synchronizability. Some previous studies assert that the maximal betweenness is a right quantity to estimate network synchronizability: the larger the maximal betweenness, the poorer the network synchronizability. Here we address an interesting case, which strongly suggests that the single quantity, maximal betweenness, may not give a comprehensive description of network synchronizability.
14 pages, and 7 figures (to be published in Physica A)
References in corpus (18)
- Efficient routing on complex networks
- Maximal planar networks with large clustering coefficient and power-law degree distribution
- Sandpile on Scale-Free Networks
- Factors that predict better synchronizability on complex networks
- Epidemic spread in weighted scale-free networks
- Modular synchronization in complex networks
- Synchronization transition in scale-free networks: Clusters of synchrony
- Performance of networks of artificial neurons: The role of clustering
- Clustering and Synchronization of Oscillator Networks
- Efficient routing on scale-free networks based on local information
- Enhance synchronizability by structural perturbations
- Coherence in scale-free networks of chaotic maps
- Perturbation: the Catastrophe Causer in Scale-Free Networks
- Optimization of network structure to random failures
- Better Synchronizability Predicted by Crossed Double Cycle
- Integer Networks
- The synchronizability of highly clustered scale-free networks
- Dynamical mean-filed approximation to small-world networks of spiking neurons: From local to global, and/or from regular to random couplings
Cited by in corpus (15)
- Synchronization in complex networks
- Synchronization of interconnected networks: the role of connector nodes
- Synchronization on community networks
- Network synchronizability analysis: the theory of subgraphs and complementary graphs
- Better synchronizability predicted by a new coupling method
- Coarse Graining for Synchronization in Directed Networks
- Empirical study on clique-degree distribution of networks
- Optimal Tree for Both Synchronizability and Converging Time
- Enhance synchronizability via age-based coupling
- Lower bound of assortativity coefficient in scale-free networks
- Reconstructing directed networks for better synchronization
- Optimal synchronization on strongly connected directed networks
- Analysis and control of network synchronizability
- Multiple predator based capture process on complex networks
- Disconnected synchronized regions of complex dynamical networks