4.7 Review

Disagreement and Antagonism in Signed Networks: A Survey

期刊

IEEE-CAA JOURNAL OF AUTOMATICA SINICA
卷 9, 期 7, 页码 1166-1187

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JAS.2022.105680

关键词

Antagonistic interaction; disagreement behavior; dynamic topology; signed network; static topology

资金

  1. National Natural Science Foundation of China [61922007, 61873013, U1966202]

向作者/读者索取更多资源

This paper reviews different disagreement behaviors in signed networks and discusses the convergence and fluctuation behaviors under static and dynamic topologies. For static signed networks, the behaviors with fixed topologies and switching topologies are investigated, and brief introductions on general time-varying signed networks are provided. For dynamic signed networks, the specific descriptions and characteristics are shown, and the disagreement behaviors can be obtained using the derived static signed graphs. Applications to the behavior analysis of static signed networks with high-order dynamics or communication delays are also presented.
Signed networks refer to a class of network systems including not only cooperative but also antagonistic interactions among nodes. Due to the existence of antagonistic interactions in signed networks, the agreement of nodes may not be established, instead of which disagreement behaviors generally emerge. This paper reviews several different disagreement behaviors in signed networks under the single-integrator linear dynamics, where two classes of topologies, namely, the static topology and the dynamic topology, are considered. For the static signed networks with the adjacency weights as (time-varying) scalars, we investigate the convergence behaviors and the fluctuation behaviors with respect to fixed topologies and switching topologies, respectively, and give some brief introductions on the disagreement behaviors of general time-varying signed networks. Correspondingly, several classes of behavior analysis approaches are also provided. For the dynamic signed networks with the adjacency weights as transfer functions or linear time-invariant systems, we show the specific descriptions and characteristics of them such that the disagreement behaviors can be obtained by resorting to the derived static signed graphs. Furthermore, we give their applications to the behavior analysis of static signed networks in the presence of high-order dynamics or communication delays.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据