Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
From MaRDI portal
Publication:2139371
DOI10.1016/J.AUTOMATICA.2022.110237zbMATH Open1491.93115arXiv2011.14105OpenAlexW3173602055MaRDI QIDQ2139371FDOQ2139371
Chongzhi Wang, Haibin Shao, Dewei Li, Lulu Pan, Yugeng Xi
Publication date: 17 May 2022
Published in: Automatica (Search for Journal in Brave)
Abstract: In contrast with the scalar-weighted networks, where bipartite consensus can be achieved if and only if the underlying signed network is structurally balanced, the structural balance property is no longer a graph-theoretic equivalence to the bipartite consensus in the case of signed matrix-weighted networks. To re-establish the relationship between the network structure and the bipartite consensus solution, the non-trivial balancing set is introduced which is a set of edges whose sign negation can transform a structurally imbalanced network into a structurally balanced one and the weight matrices associated with edges in this set have a non-trivial intersection of null spaces. We show that necessary and/or sufficient conditions for bipartite consensus on matrix-weighted networks can be characterized by the uniqueness of the non-trivial balancing set, while the contribution of the associated non-trivial intersection of null spaces to the steady-state of the matrix-weighted network is examined. Moreover, for matrix-weighted networks with a positive-negative spanning tree, necessary and sufficient condition for bipartite consensus using the non-trivial balancing set is obtained. Simulation examples are provided to demonstrate the theoretical results.
Full work available at URL: https://arxiv.org/abs/2011.14105
Cites Work
- Title not available (Why is that?)
- Chromatic number and the 2-rank of a graph
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Estimation From Relative Measurements: Electrical Analogy and Large Graphs
- Consensus Problems on Networks With Antagonistic Interactions
- Translational and Scaling Formation Maneuver Control via a Bearing-Based Approach
- Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
- Matrix-weighted consensus and its applications
- Synchronization under matrix-weighted Laplacian
- Observability Through a Matrix-Weighted Graph
- Synchronization of small oscillations
- Network science on belief system dynamics under logic constraints
- Continuous-time opinion dynamics on multiple interdependent topics
This page was built for publication: Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139371)
