Interval Bipartite Synchronization of Multiple Neural Networks in Signed Graphs.

Interval bipartite consensus of multiagents described by signed graphs has received extensive concern recently, and the rooted cycles play a critical role in stabilization, while the structurally balanced graphs are essential to achieve bipartite consensus. However, the gauge transformation used in the linear system is no longer feasible in the nonlinear case. This article addresses interval bipartite synchronization of multiple neural networks (NNs) in a signed graph via a Lyapunov-based approach, extending the existing work to a more practical but complicated case. A general matrix M in signed graphs is introduced to construct the novel Lyapunov functions, and sufficient conditions are obtained. We find that the rooted cycles and the structurally balanced graphs are essential to stabilize and achieve bipartite synchronization. More importantly, we discover that the nonrooted cycles are crucial in reaching interval bipartite synchronization, not previously mentioned. Several examples are presented to illustrate interval bipartite synchronization of multiple NNs with signed graphs.