Abstract
In this paper, we consider exponential synchronization of complex networks. The information diffusions between nodes are driven by properly defined events. By employing the M-matrix theory, algebraic graph theory and the Lyapunov method, two kinds of distributed event-triggering laws are designed, which avoid continuous communications between nodes. Then, several criteria that ensure the event-based exponential synchronization are presented, and the exponential convergence rates are obtained as well. Furthermore, we prove that Zeno behavior of the event-triggering laws can be excluded before synchronization being achieved, that is, the lower bounds of inter-event times are strictly positive. Finally, a simulation example is provided to illustrate the effectiveness of theoretical analysis.
Sign-in/Register to access full text options 
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.
