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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
