Characterizing bipartite consensus on signed matrix-weighted networks via balancing set

DOI10.1016/J.AUTOMATICA.2022.110237MaRDI QIDQ2139371zbMATH OpenOpenAlexFDO

Authors Chongzhi Wang, Lulu Pan, Haibin Shao, Dewei Li, Yugeng Xi

Publication date 17 May 2022

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.14105

zbMATH Keywords

structural balancenull spacebipartite consensusbalancing setmatrix-weighted networks

Mathematics Subject Classification ID

Networked control (93B70) Consensus (93D50)

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.

Recommendations

• Cluster consensus on matrix-weighted switching networks
• Event-based bipartite consensus of second-order discrete-time multi-agent systems with matrix-weighted signed networks
• Matrix-weighted consensus and its applications
• scientific article; zbMATH DE number 7155747
• Signed consensus problems on networks of agents with fixed and switching topologies

Cites work

• Chromatic number and the 2-rank of a graph
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus Problems on Networks With Antagonistic Interactions
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Continuous-time opinion dynamics on multiple interdependent topics
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Estimation From Relative Measurements: Electrical Analogy and Large Graphs
• Graph theoretic methods in multiagent networks
• Matrix-weighted consensus and its applications
• Network science on belief system dynamics under logic constraints
• Observability Through a Matrix-Weighted Graph
• Studies on the balancing, the minimal balancing, and the minimum balancing processes for social groups with planar and nonplanar graph structures
• Synchronization of small oscillations
• Synchronization under matrix-weighted Laplacian
• Translational and Scaling Formation Maneuver Control via a Bearing-Based Approach

Cited in

(4)

• Behaviors of matrix-weighted networks with antagonistic interactions
• Structural Balance and Random Walks on Complex Networks with Complex Weights
• Sub-super-stochastic matrix with applications to bipartite tracking control over signed networks
• Cluster consensus on matrix-weighted switching networks

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)