Abstract
Abstract Synchronization for generic directed networks is investigated in this paper. Based on Lyapunov stability theory, a sufficient condition for synchronization of directed networks is derived. Compared with other approaches, where weighted path-lengths are required, or the complex eigenvalues of an asymmetric matrix, Jacobian matrix or Kronecker product need to be calculated, the sufficient condition in this paper is simple and convenient to use. Two typical examples of directed networks with chaotic nodes are finally demonstrated to verify the theoretical results and the effectiveness of the proposed synchronization scheme.
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.
