This chapter investigates the disagreement behavior analysis problem for fixed signed networks in the presence of strongly connected topologies. Since of our specific interest is the Laplacian-type dynamic flow of agents, we resort to the Laplacian matrices of signed digraphs, and leverage an M-matrix-based analysis approach to arrive at that their semi-positive and positive stabilities can be, respectively, tied to the structural balance and unbalance properties even in the absence of the digon sign-symmetry assumption. Furthermore, we reveal a fact that for any strongly connected signed network, the bipartite consensus (respectively, stability) can be realized if and only if its associated signed digraph is structurally balanced (respectively, unbalanced). Simulations are also included to illustrate the convergence behaviors observed for strongly connected signed networks.
Bipartite Consensus
Intelligent Control & Learning Systems
2022-12-03
16 pages
Article/Chapter (Book)
Electronic Resource
English
Springer Verlag | 2022
|Quasi-Interval Bipartite Consensus
Springer Verlag | 2022
|Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
British Library Online Contents | 2011
|