Topology-based Conditions for Multiconsensus under the Signed Friedkin-Johnsen Model
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911332223156224 |
|---|---|
| author | Shrinate, Aashi Siddharth, Tanmay Tripathy, Twinkle |
| author_facet | Shrinate, Aashi Siddharth, Tanmay Tripathy, Twinkle |
| contents | In this paper, we address the multiconsensus problem in networked systems, where agents are partitioned into disjoint subgroups and the states of agents within a subgroup are driven to consensus. Our objective is to present a distributed control law that leads to multiconsensus in signed digraphs. To this end, we examine the convergence of opinions under the opposing rule-based signed Friedkin-Johnsen (SFJ) model and present conditions that lead to multiconsensus under this model. Interestingly, the proposed conditions depend only on graph topology and signed interactions and not on the edge weights of the network. Consequently, the proposed SFJ-based control law relaxes the in-degree balance and homogeneity of trust-distrust, frequently assumed in the literature. Finally, we add simulation results to demonstrate the proposed conditions for multiconsensus. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_19258 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Topology-based Conditions for Multiconsensus under the Signed Friedkin-Johnsen Model Shrinate, Aashi Siddharth, Tanmay Tripathy, Twinkle Systems and Control In this paper, we address the multiconsensus problem in networked systems, where agents are partitioned into disjoint subgroups and the states of agents within a subgroup are driven to consensus. Our objective is to present a distributed control law that leads to multiconsensus in signed digraphs. To this end, we examine the convergence of opinions under the opposing rule-based signed Friedkin-Johnsen (SFJ) model and present conditions that lead to multiconsensus under this model. Interestingly, the proposed conditions depend only on graph topology and signed interactions and not on the edge weights of the network. Consequently, the proposed SFJ-based control law relaxes the in-degree balance and homogeneity of trust-distrust, frequently assumed in the literature. Finally, we add simulation results to demonstrate the proposed conditions for multiconsensus. |
| title | Topology-based Conditions for Multiconsensus under the Signed Friedkin-Johnsen Model |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2512.19258 |