Enhancing synchronizability of weighted dynamical networks using betweenness centrality
classification
⚛️ physics.soc-ph
keywords
networkssynchronizabilitybetweennesscentralitydynamicalenhanceprocedureartificially
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.