Heterogeneity in oscillator networks: Are smaller worlds easier to synchronize?
Nishikawa, Takashi ; Motter, Adilson E. ; Lai, Ying-Cheng ; Hoppensteadt, Frank C.
arXiv, 0306625 / Harvested from arXiv
Text on arXiv
Small-world and scale-free networks are known to be more easily synchronized than regular lattices, which is usually attributed to the smaller network distance between oscillators. Surprisingly, we find that networks with a homogeneous distribution of connectivity are more synchronizable than heterogeneous ones, even though the average network distance is larger. We present numerical computations and analytical estimates on synchronizability of the network in terms of its heterogeneity parameters. Our results suggest that some degree of homogeneity is expected in naturally evolved structures, such as neural networks, where synchronizability is desirable.
Publié le : 2003-06-24
Classification:  Condensed Matter - Disordered Systems and Neural Networks,  Mathematical Physics,  Nonlinear Sciences - Chaotic Dynamics,  Quantitative Biology - Neurons and Cognition 
@article{0306625,
     author = {Nishikawa, Takashi and Motter, Adilson E. and Lai, Ying-Cheng and Hoppensteadt, Frank C.},
     title = {Heterogeneity in oscillator networks: Are smaller worlds easier to
  synchronize?},
     journal = {arXiv},
     volume = {2003},
     number = {0},
     year = {2003},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0306625}
}

Nishikawa, Takashi; Motter, Adilson E.; Lai, Ying-Cheng; Hoppensteadt, Frank C. Heterogeneity in oscillator networks: Are smaller worlds easier to
  synchronize?. arXiv, Tome 2003 (2003) no. 0, . http://gdmltest.u-ga.fr/item/0306625/