Abstract
This brief examines bipartite consensus problem on matrix-valued weighted networks. First, it is shown that such networks achieve bipartite consensus if and only if the null space of the matrix-valued weighted Laplacian is spanned by a matrix-valued Gauge transformation, extending results for scalar-valued weighted networks. Second, it is shown that if a structurally balanced matrix-valued weighted network has a “positive-negative spanning tree,” then the bipartite consensus can be achieved. Lastly, we show that in the case where edges are weighted by either positive definite or negative definite matrices, bipartite consensus is achieved if and only if the network is structurally balanced. Simulation results are provided to demonstrate these theoretical observations.
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 II: Express Briefs
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.
