IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v371y2006i2p773-780.html
   My bibliography  Save this article

Relations between average distance, heterogeneity and network synchronizability

Author

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

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 ensures strong synchronizability. Some previous studies assert that the maximal betweenness is the 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.

Suggested Citation

  • Zhao, Ming & Zhou, Tao & Wang, Bing-Hong & Yan, Gang & Yang, Hui-Jie & Bai, Wen-Jie, 2006. "Relations between average distance, heterogeneity and network synchronizability," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 773-780.
    • Handle: RePEc:eee:phsmap:v:371:y:2006:i:2:p:773-780
    DOI: 10.1016/j.physa.2006.03.041
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437106003815
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2006.03.041?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wen, Guanghui & Duan, Zhisheng & Chen, Guanrong & Geng, Xianmin, 2011. "A weighted local-world evolving network model with aging nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(21), pages 4012-4026.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:371:y:2006:i:2:p:773-780. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.