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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Bipartite Consensus


    Additional title:

    Intelligent Control & Learning Systems


    Contributors:
    Meng, Deyuan (author) / Du, Mingjun (author) / Wu, Yuxin (author)


    Publication date :

    2022-12-03


    Size :

    16 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Interval Bipartite Consensus

    Meng, Deyuan / Du, Mingjun / Wu, Yuxin | Springer Verlag | 2022


    Quasi-Interval Bipartite Consensus

    Meng, Deyuan / Du, Mingjun / Wu, Yuxin | Springer Verlag | 2022



    Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs

    Groshaus, M. / Szwarcfiter, J.L. | British Library Online Contents | 2011


    BIPARTITE PET HUT

    GOTO HIROSHI / GOTO SHINYA / GOTO RYOTA | European Patent Office | 2017

    Free access