Extended Structural Balance and Disagreement Behaviors for Switching Networks With Antagonistic Interactions

Meng, Deyuan; Wu, Yuxin; Du, Mingjun

doi:10.1109/tcns.2020.3034531

Cited by 6 publications

(1 citation statement)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An extension to a directed spanning tree scenario was discussed in [13], as well as graphical condition on stability of the agents [14]. Further generalizations contain switching networks [15], random signed networks [16], networked multi-agent systems [17], fractional-order systems [18], and networked PDE systems [19], etc.…”

mentioning

confidence: 99%

Coordination on Time-Varying Antagonistic Networks

Zhang

2021

Preprint

View full text Add to dashboard Cite

This paper studies coordination problem for time-varying networks suffering from antagonistic information, quantified by scaling parameters. By such a manner, interacting property of the participating individuals and antagonistic information can be quantified in a fully decoupled perspective, thus benefiting from merely directed spanning tree hypothesis is needed, in the sense of usual algebraic graph theory. We start with rigorous argument on the existence of weighted gain, and then derive relation among weighted gain, scaling parameter and Laplacian matrix guaranteeing antagonistic information cannot diverge system state. Based on these arguments, we devise coordination algorithm constrained by topology-dependent average time condition, thus relaxing the examination of directed spanning tree requirement for the union graph that is usually intractable. Moreover, the induced theoretical results are applied to time-varying networks with several mutually uninfluenced agents, in accompanying with some discussions and comparisons with respect to the existing developments.

show abstract