pith. sign in

arxiv: 1106.4337 · v2 · pith:WAF2KHM3new · submitted 2011-06-21 · ❄️ cond-mat.dis-nn · cs.SI· nlin.CD· physics.soc-ph

Speed of complex network synchronization

classification ❄️ cond-mat.dis-nn cs.SInlin.CDphysics.soc-ph
keywords synchronizationnetworkstimescompletelydisorderedfixedintermediatenetwork
0
0 comments X
read the original abstract

Synchrony is one of the most common dynamical states emerging on networks. The speed of convergence towards synchrony provides a fundamental collective time scale for synchronizing systems. Here we study the asymptotic synchronization times for directed networks with topologies ranging from completely ordered, grid-like, to completely disordered, random, including intermediate, partially disordered topologies. We extend the approach of Master Stability Functions to quantify synchronization times. We find that the synchronization times strongly and systematically depend on the network topology. In particular, at fixed in-degree, stronger topological randomness induces faster synchronization, whereas at fixed path length, synchronization is slowest for intermediate randomness in the small-world regime. Randomly rewiring real-world neural, social and transport networks confirms this picture.

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.