The Fast Fixed-Time Bipartite Synchronization of Coupled Delayed Neural Networks with Signed Graphs

In this paper, the fixed-time bipartite synchronization problem for coupled delayed neural networks with signed graphs is discussed. Different from traditional neural networks, the interactions between nodes of delayed neural networks can be either collaborative or antagonistic. Furthermore, compared with the initial-condition based finite-time synchronization, the settling time is bounded by a constant within fixedtime regardless of the initial condition. It is worth noting that the fixed-time stable network for bipartite synchronization in this paper achieves more faster convergence than most existing publications. By applying constructing comparison system method, Lyapunov stability theory and inequality techniques, some sufficient criteria for fixed-time bipartite synchronization are obtained. Finally, two numerical examples are granted to display the performance of the obtained results.

Fixed-Time Synchronization Control of Delayed Dynamical Complex Networks

Fixed-time synchronization problem for delayed dynamical complex networks is explored in this paper. Compared with some correspondingly existed results, a few new results are obtained to guarantee fixed-time synchronization of delayed dynamical networks model. Moreover, by designing adaptive controller and discontinuous feedback controller, fixed-time synchronization can be realized through regulating the main control parameter. Additionally, a new theorem for fixed-time synchronization is used to reduce the conservatism of the existing work in terms of conditions and the estimate of synchronization time. In particular, we obtain some fixed-time synchronization criteria for a type of coupled delayed neural networks. Finally, the analysis and comparison of the proposed controllers are given to demonstrate the validness of the derived results from one numerical example.