In Chaps. 3 and 4, the disagreement behavior analysis of signed networks has been implemented in the presence of some specific connectivity properties. A further question is: What will the disagreement behaviors be when the signed networks are subject to more general signed digraphs without any connectivity properties? To answer this question, this chapter establishes an extended leader–follower framework for signed networks despite any signed digraphs, under which a class of leader-contained disagreement behaviors, called bipartite containment tracking, can be revealed based on the M-matrix-based analysis approach. It is shown that for any signed networks, each leader group realizes bipartite consensus or stability, depending on the structural balance or unbalance property, and the followers converge to the minimal convex hull spanned by the converged states and the symmetric states of all leaders, implying the dominant roles of the leaders. A simulation example is provided to demonstrate the observed bipartite containment tracking behaviors of signed networks.
Bipartite Containment Tracking
Intelligent Control & Learning Systems
2022-12-03
13 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Springer Verlag | 2022
|Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs
British Library Online Contents | 2011
|Springer Verlag | 2022
|Quasi-Interval Bipartite Consensus
Springer Verlag | 2022
|