Topology-based Conditions for Multiconsensus under the Signed Friedkin-Johnsen Model

TL;DR

This paper establishes topology-based conditions for achieving multiconsensus in signed digraphs using the Friedkin-Johnsen model, providing a distributed control law that relaxes common assumptions and is verified through simulations.

Contribution

It introduces new graph-topology conditions for multiconsensus in signed networks and proposes a distributed control law that does not depend on edge weights.

Findings

Conditions depend only on graph topology and signed interactions.

The control law relaxes in-degree balance and trust-distrust homogeneity.

Simulations confirm the effectiveness of the proposed conditions.

Abstract

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.