Skip to content

Self-Organization of Weighted Networks for Optimal Synchronizability

Research output: Contribution to journalArticle

Original languageEnglish
Article number7993095
Pages (from-to)1541-1550
Number of pages10
JournalIEEE Transactions on Control of Network Systems
Volume5
Issue number4
Early online date26 Jul 2017
DOIs
DateAccepted/In press - 7 Jul 2017
DateE-pub ahead of print - 26 Jul 2017
DatePublished (current) - 1 Dec 2018

Abstract

We show that a network can self-organize its existing topology, i.e., by adapting edge weights, in a completely decentralized manner in order to maximize its synchronizability while satisfying local constraints: we look specifically at nonnegativity of edge weights and maximum weighted degree of nodes. A novel multilayer approach is presented, which uses a decentralized strategy through which each node can estimate one of two spectral functions of the graph Laplacian, the algebraic connectivity λ2, or the eigenratio r=λn / λ2. These local estimates are then used to evolve the edge weights so as to maximize λ2, or minimize r, and, hence, achieve globally optimal values for the edge weights for the synchronization of a network of coupled systems.

    Research areas

  • Complex networks, decentralized control, optimization

Download statistics

No data available

Documents

Documents

  • Full-text PDF (accepted author manuscript)

    Rights statement: This is the author accepted manuscript (AAM). The final published version (version of record) is available online via IEEE at http://ieeexplore.ieee.org/document/6728751/. Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 626 KB, PDF-document

DOI

View research connections

Related faculties, schools or groups