Finite-time and fixed-time bipartite synchronization of complex networks with signed graphs

In this paper, we study finite-time (FET) and fixed-time (FDT) bipartite synchronization of complex networks (CNs) with signed graphs. Under the framework of signed graphs, the interactions between nodes can be either collaborative or antagonistic, which are different from the traditional CNs. Two t...

Full description

Saved in:
Bibliographic Details
Published inMathematics and computers in simulation Vol. 188; pp. 319 - 329
Main Authors Zhang, Wanli, Yang, Xinsong, Yang, Shiju, Alsaedi, Ahmed
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.10.2021
Subjects
Bipartite synchronization
Complex networks
Finite-time synchronization
Fixed-time synchronization
Signed graphs
Fixed-time synchronization
Finite-time synchronization
Complex networks
Signed graphs
Bipartite synchronization
Online AccessGet full text
ISSN0378-4754
1872-7166
DOI10.1016/j.matcom.2021.04.013

Cover

More Information
Summary:In this paper, we study finite-time (FET) and fixed-time (FDT) bipartite synchronization of complex networks (CNs) with signed graphs. Under the framework of signed graphs, the interactions between nodes can be either collaborative or antagonistic, which are different from the traditional CNs. Two types of control schemes without the sign function are designed to realize FET and FDT bipartite synchronization of CNs, respectively. By 1-norm analytical techniques and Lyapunov functional method, FET bipartite synchronization criterion is established. By means of the constructed comparison system, FDT bipartite synchronization is proved. In addition, the settling times of both FET synchronization and FDT synchronization are estimated. It is worth noting that the settling time of FDT bipartite synchronization is not related to the initial values. Moreover, numerical simulations are given to illustrate the new results.
ISSN:0378-4754
1872-7166
DOI:10.1016/j.matcom.2021.04.013