文献类型：期刊文献

中文题名：Bipartite quasi-synchronization of multiple neural networks with generalized cooperative-competitive topology

英文题名：Bipartite quasi-synchronization of multiple neural networks with generalized cooperative-competitive topology

作者：Li, Ning[1];Cao, JinDe[2,3]

第一作者：李宁

通讯作者：Li, N[1];Cao, JD[2];Cao, JD[3]

机构：[1]Henan Univ Econ & Law, Sch Math & Informat Sci, Zhengzhou 450046, Peoples R China;[2]Southeast Univ, Sch Math, Nanjing 210096, Peoples R China;[3]Yonsei Univ, Yonsei Frontier Lab, Seoul 03722, South Korea

第一机构：河南财经政法大学数学与信息科学学院

通讯机构：[1]corresponding author), Henan Univ Econ & Law, Sch Math & Informat Sci, Zhengzhou 450046, Peoples R China;[2]corresponding author), Southeast Univ, Sch Math, Nanjing 210096, Peoples R China;[3]corresponding author), Yonsei Univ, Yonsei Frontier Lab, Seoul 03722, South Korea.|[1048425]河南财经政法大学数学与信息科学学院;[10484]河南财经政法大学;

年份：2023

卷号：66

期号：6

起止页码：1855-1866

中文期刊名：中国科学:技术科学英文版

外文期刊名：SCIENCE CHINA-TECHNOLOGICAL SCIENCES

收录：CSTPCD;;EI(收录号：20232314193724);Scopus(收录号：2-s2.0-85161008819);WOS:【SCI-EXPANDED(收录号:WOS:001002750900023)】；CSCD:【CSCD2023_2024】；PubMed;

基金：This work was supported by the National Natural Science Foundation of China (Grant Nos. 62073122 , 61833005 and 11872175), the Outstanding Youth Science Foundation Project of Henan Province (Grant No.222300420022), and the Key Program of Higher Education of Henan Province (Grant No. 21A120001).

语种：英文

中文关键词：B-Q synchronization;structurally unbalanced;event-triggered communication;Markovian switching topology

外文关键词：B-Q synchronization; structurally unbalanced; event-triggered communication; Markovian switching topology

摘要：This study examines the bipartite quasi-synchronization(B-Q synchronization)issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the communication cost.In the existing literature concerning bipartite synchronization,the network topology is required to be structurally balanced,which necessitates that competitive interactions exist only between two distinct subgroups.In this study,we aim to lengthen the network’s topology to a more general signed network in which antagonistic interactions can exist in the same or different subgroups.According to signed graph theory and the markovian stochastic event-triggering mechanism,the dynamical model of multiple neural networks(MNNs)with structurally unbalanced and markovian event-triggered communication is established.By utilizing the stochastic Lyapunov stability analysis,some adequate criteria for B-Q synchronization of MNNs with the structurally unbalanced graph are obtained;also,a bound for the B-Q synchronization error is provided.As a special case,the bipartite synchronization criteria for MNNs with the structurally balanced graph are also obtained.Finally,two simulations are performed to verify the theoretical result.
This study examines the bipartite quasi-synchronization (B-Q synchronization) issue of coupled networks with general cooperative-competitive topology and the event-triggered communications between nodes to curb the communication cost. In the existing literature concerning bipartite synchronization, the network topology is required to be structurally balanced, which necessitates that competitive interactions exist only between two distinct subgroups. In this study, we aim to lengthen the network's topology to a more general signed network in which antagonistic interactions can exist in the same or different subgroups. According to signed graph theory and the markovian stochastic event-triggering mechanism, the dynamical model of multiple neural networks (MNNs) with structurally unbalanced and markovian event-triggered communication is established. By utilizing the stochastic Lyapunov stability analysis, some adequate criteria for B-Q synchronization of MNNs with the structurally unbalanced graph are obtained; also, a bound for the B-Q synchronization error is provided. As a special case, the bipartite synchronization criteria for MNNs with the structurally balanced graph are also obtained. Finally, two simulations are performed to verify the theoretical result.