Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks

Chongzhi Wang, Haibin Shao, Ying Tan, Dewei Li
7/3/2023
eess.SYcs.MA

No confident code implementation found for this paper.

Abstract

Recent advancements in bipartite consensus, a scenario where agents are divided into two disjoint sets with agents in the same set agreeing on a certain value and those in different sets agreeing on opposite or specifically related values, have highlighted its potential applications across various fields. Traditional research typically relies on the presence of a positive-negative spanning tree, which limits the practical applicability of bipartite consensus. This study relaxes that assumption by allowing for weak connectivity within the network, where paths can be weighted by semidefinite matrices. By exploring the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive sufficient conditions for achieving bipartite consensus. Our theoretical findings are validated through numerical results.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{wang2023sufficient,
  title  = {Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks},
  author = {Chongzhi Wang and Haibin Shao and Ying Tan and Dewei Li},
  year   = {2023},
  eprint = {2307.00824},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.00824v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.00824.svg)](https://codeofpaper.com/paper/2307.00824)

Discussion