pith. sign in

arxiv: nlin/0502055 · v1 · submitted 2005-02-24 · 🌊 nlin.CD · cond-mat.dis-nn· nlin.AO

Sufficient Conditions for Fast Switching Synchronization in Time Varying Network Topologies

classification 🌊 nlin.CD cond-mat.dis-nnnlin.AO
keywords networkfastsynchronizationtopologyoscillatorssufficientswitchingtime-varying
0
0 comments X
read the original abstract

In previous work, empirical evidence indicated that a time-varying network could propagate sufficient information to allow synchronization of the sometimes coupled oscillators, despite an instantaneously disconnected topology. We prove here that if the network of oscillators synchronizes for the static time-average of the topology, then the network will synchronize with the time-varying topology if the time-average is achieved sufficiently fast. Fast switching, fast on the time-scale of the coupled oscillators, overcomes the descychnronizing decoherence suggested by disconnected instantaneous networks. This result agrees in spirit with that of where empirical evidence suggested that a moving averaged graph Laplacian could be used in the master-stability function analysis. A new fast switching stability criterion here-in gives sufficiency of a fast-switching network leading to synchronization. Although this sufficient condition appears to be very conservative, it provides new insights about the requirements for synchronization when the network topology is time-varying. In particular, it can be shown that networks of oscillators can synchronize even if at every point in time the frozen-time network topology is insufficiently connected to achieve synchronization.

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.