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

Network skeleton for synchronization: Identifying redundant connections

Author

Listed:
  • Zhang, Cheng-Jun
  • Zeng, An

Abstract

Synchronization is an important dynamical process on complex networks with wide applications. In this paper, we design a greedy link removal algorithm and find that many links in networks are actually redundant for synchronization, i.e. the synchronizability of the network is hardly affected if these links are removed. Our analysis shows that homogeneous networks generally have more redundant links than heterogeneous networks. We denote the reduced network with the minimum number of links to preserve synchronizability (eigenratio of the Laplacian matrix) of the original network as the synchronization backbone. Simulating the Kuramoto model, we confirm that the network synchronizability is effectively preserved in the backbone. Moreover, the topological properties of the original network and backbone are compared in detail.

Suggested Citation

  • Zhang, Cheng-Jun & Zeng, An, 2014. "Network skeleton for synchronization: Identifying redundant connections," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 402(C), pages 180-185.
  • Handle: RePEc:eee:phsmap:v:402:y:2014:i:c:p:180-185
    DOI: 10.1016/j.physa.2014.02.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437114000934
    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.2014.02.002?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. Wei, Bo & Liu, Jie & Wei, Daijun & Gao, Cai & Deng, Yong, 2015. "Weighted k-shell decomposition for complex networks based on potential edge weights," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 277-283.
    2. Wang, Junyi & Hou, Xiaoni & Li, Kezan & Ding, Yong, 2017. "A novel weight neighborhood centrality algorithm for identifying influential spreaders in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 475(C), pages 88-105.

    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:402:y:2014:i:c:p:180-185. 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.