Relations between Average Distance, Heterogeneity and Network Synchronizability
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.
Cite
@article{arxiv.cond-mat/0510332,
title = {Relations between Average Distance, Heterogeneity and Network Synchronizability},
author = {Ming Zhao and Tao Zhou and Bing-Hong Wang and Gang Yan and Hui-Jie Yang and Wen-Jie Bai},
journal= {arXiv preprint arXiv:cond-mat/0510332},
year = {2009}
}
Comments
14 pages, and 7 figures (to be published in Physica A)