Self-Organization of Weighted Networks for Optimal Synchronizability

Louis Kempton*, Guido Herrmann, Mario Di Bernardo

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

18 Citations (Scopus)
423 Downloads (Pure)


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.

Original languageEnglish
Article number7993095
Pages (from-to)1541-1550
Number of pages10
JournalIEEE Transactions on Control of Network Systems
Issue number4
Early online date26 Jul 2017
Publication statusPublished - 1 Dec 2018

Structured keywords

  • Engineering Mathematics Research Group


  • Complex networks
  • decentralized control
  • optimization


Dive into the research topics of 'Self-Organization of Weighted Networks for Optimal Synchronizability'. Together they form a unique fingerprint.

Cite this