Enhancing synchronizability of weighted dynamical networks using betweenness centrality

TL;DR

This paper introduces a method to improve the synchronizability of weighted dynamical networks by leveraging betweenness centrality measures, applicable to various network types including real-world graphs.

Contribution

The paper presents a novel weighting procedure based on betweenness centrality to enhance network synchronizability, applicable to both identical and nonidentical oscillator networks.

Findings

The method improves synchronizability in scale-free, Watts-Strogatz, and random networks.

It is effective on real-world network graphs.

The approach also enhances phase synchronizability of nonidentical oscillator networks.

Abstract

By considering the eigenratio of the Laplacian of the connection graph as synchronizability measure, we propose a procedure for weighting dynamical networks to enhance theirsynchronizability. The method is based on node and edge betweenness centrality measures and is tested on artificially const ructed scale-free, Watts-Strogatz and random networks as well as on some real-world graphs. It is also numerically shown that the same procedure could be used to enhance the phase synchronizability of networks of nonidentical oscillators.