Enhancing synchronizability of weighted dynamical networks using betweenness centrality
arXiv:0812.4720 · doi:10.1103/PhysRevE.78.016105
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.
References in corpus (9)
- The structure and function of complex networks
- Lethality and centrality in protein networks
- Efficient Behavior of Small-World Networks
- Self-similar community structure in organisations
- Prediction and predictability of global epidemics: the role of the airline transportation network
- Network Synchronization, Diffusion, and the Paradox of Heterogeneity
- Enhancing complex-network synchronization
- Self-organization of collaboration networks
- Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations