arXiv Analytics

Sign in

arXiv:cond-mat/0510332AbstractReferencesReviewsResources

Relations between Average Distance, Heterogeneity and Network Synchronizability

Ming Zhao, Tao Zhou, Bing-Hong Wang, Gang Yan, Hui-Jie Yang, Wen-Jie Bai

Published 2005-10-13, updated 2006-04-21Version 2

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.

Comments: 14 pages, and 7 figures (to be published in Physica A)
Journal: Physica A 371, 773-780(2006)
Categories: cond-mat.stat-mech
Related articles: Most relevant | Search more
arXiv:cond-mat/0512485 (Published 2005-12-20)
Scale-free networks without growth
arXiv:cond-mat/0507345 (Published 2005-07-14)
Sampling properties of random graphs: the degree distribution
arXiv:cond-mat/0605587 (Published 2006-05-24, updated 2008-04-29)
Self-similarity in Fractal and Non-fractal Networks