Non-Trivial Consensus on Directed Matrix-Weighted Networks with Cooperative and Antagonistic Interactions

TL;DR

This paper explores non-trivial consensus in directed signed matrix-weighted networks with cooperative and antagonistic interactions, providing new theoretical insights and algorithms for achieving preset consensus states under milder conditions.

Contribution

It introduces a novel convergence state, proves eigenvalue positivity of grounded Laplacians, and develops a systematic approach for non-trivial consensus without structural balance restrictions.

Findings

Eigenvalues of grounded Laplacians have positive real parts under certain conditions

Consensus can be achieved with milder connectivity and no structural balance restrictions

Non-trivial consensus states can be preset arbitrarily

Abstract

This paper investigates the non-trivial consensus problem on directed signed matrix-weighted networks\textemdash a novel convergence state that has remained largely unexplored despite prior studies on bipartite consensus and trivial consensus. Notably, we first prove that for directed signed matrix-weighted networks, every eigenvalue of the grounded Laplacians has positive real part under certain conditions. This key finding ensures the global asymptotic convergence of systems states to the null spaces of signed matrix-weighted Laplacians, providing a foundational tool for analyzing dynamics on rooted signed matrix-weighted networks. To achieve non-trivial consensus, we propose a systematic approach involving the strategic selection of informed agents, careful design of external signals, and precise determination of coupling terms. Crucially, we derive the lower bounds of the coupling coefficients. Our consensus algorithm operates under milder connectivity conditions, and does not impose restrictions on whether the network is structurally balanced or unbalanced. Moreover, the non-trivial consensus state can be preset arbitrarily as needed. We also carry out the above analysis for undirected networks, with more relaxed conditions on the coupling coefficients comparing to the directed case. This paper further studies non-trivial consensus with switching topologies, and propose the necessary condition for the convergence of switching networks. The work in this paper demonstrates that groups with both cooperative and antagonistic multi-dimensional interactions can achieve consensus, which was previously deemed exclusive to fully cooperative groups.