Abstract
We consider the outer synchronization between drive-response systems on networks with time-varying delays, where we focus on the case when the underlying networks are not strongly connected. A hierarchical method is proposed to characterize large-scale networks without strong connectedness. The hierarchical algorithm can be implemented by some programs to overcome the difficulty resulting from the scale of networks. This method allows us to obtain two different kinds of sufficient outer synchronization criteria without the assumption of being strongly connected, by combining the theory of asymptotically autonomous systems with Lyapunov method and Kirchhoff's Matrix Tree Theorem in graph theory. The theory improves some existing results obtained by graph theory. As illustrations, the theoretic results are applied to delayed coupled oscillators and a numerical example is also given.
| Original language | English |
|---|---|
| Pages (from-to) | 837-859 |
| Number of pages | 23 |
| Journal | Discrete and Continuous Dynamical Systems - Series B |
| Volume | 23 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2018 |
| Externally published | Yes |
Keywords
- Coupled systems
- Graph theory
- Hierarchical method
- Not strongly connected
- Outer synchronization
Fingerprint
Dive into the research topics of 'Outer synchronization of delayed coupled systems on networks without strong connectedness: A hierarchical method'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver