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.
|Number of pages||10|
|Journal||IEEE Transactions on Control of Network Systems|
|Early online date||26 Jul 2017|
|Publication status||Published - 1 Dec 2018|
- Complex networks
- decentralized control
FingerprintDive into the research topics of 'Self-Organization of Weighted Networks for Optimal Synchronizability'. Together they form a unique fingerprint.
20 Mar 2018
Supervisor: Di Bernardo, M. (Supervisor) & Herrmann, G. (Supervisor)
Student thesis: Doctoral Thesis › Doctor of Philosophy (PhD)File