Abstract
We study synchronization and consensus phenomena in state-dependent graphs in which the edges are weighted according to the Hebbian learning rule or its modified version. By exploring the master stability function of the synchronous state, we show that the modified Hebbian function as coupling strength enlarges the stability region of the synchronous state. In terms of consensus, given that the state-dependent weights are always positive, we prove that consensus in a network of multi-agent systems is always reachable. Furthermore, we show that in state-dependent graphs the second smallest eigenvalue of the graph Laplacian matrix has larger values due to the state-dependency, resulting in speed up of the convergence process.
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 callMore From: IEEE Transactions on Circuits and Systems I: Regular Papers
Disclaimer: 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.
