Yi Wang, Zhongjun Ma, Jinde Cao, A. Alsaedi, F. Alsaadi
{"title":"非同非线性动力学有向网络的自适应簇同步","authors":"Yi Wang, Zhongjun Ma, Jinde Cao, A. Alsaedi, F. Alsaadi","doi":"10.1002/cplx.21816","DOIUrl":null,"url":null,"abstract":"In this article, the problem of cluster synchronization in the complex networks with nonidentical nonlinear dynamics is considered. By Lyapunov functional and M-matrix theory, some sufficient conditions for cluster synchronization are obtained. Moreover, the least number of nodes which should be pinned is given. It is shown that when the root nodes of all the clusters are pinning-controlled, cluster synchronization with adaptive coupling strength can be achieved. Different from the constraints of many literatures, the assumption is that each row sum for all diagonal submatrices of the Laplacian matrix is equal to zero. Finally, a numerical simulation in the network with three scale-free subnetwork is provided to demonstrate the effectiveness of the theoretical results. © 2016 Wiley Periodicals, Inc. Complexity 21: 380–387, 2016","PeriodicalId":72654,"journal":{"name":"Complex psychiatry","volume":"74 1","pages":"380-387"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Adaptive cluster synchronization in directed networks with nonidentical nonlinear dynamics\",\"authors\":\"Yi Wang, Zhongjun Ma, Jinde Cao, A. Alsaedi, F. Alsaadi\",\"doi\":\"10.1002/cplx.21816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, the problem of cluster synchronization in the complex networks with nonidentical nonlinear dynamics is considered. By Lyapunov functional and M-matrix theory, some sufficient conditions for cluster synchronization are obtained. Moreover, the least number of nodes which should be pinned is given. It is shown that when the root nodes of all the clusters are pinning-controlled, cluster synchronization with adaptive coupling strength can be achieved. Different from the constraints of many literatures, the assumption is that each row sum for all diagonal submatrices of the Laplacian matrix is equal to zero. Finally, a numerical simulation in the network with three scale-free subnetwork is provided to demonstrate the effectiveness of the theoretical results. © 2016 Wiley Periodicals, Inc. Complexity 21: 380–387, 2016\",\"PeriodicalId\":72654,\"journal\":{\"name\":\"Complex psychiatry\",\"volume\":\"74 1\",\"pages\":\"380-387\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex psychiatry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/cplx.21816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex psychiatry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/cplx.21816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Adaptive cluster synchronization in directed networks with nonidentical nonlinear dynamics
In this article, the problem of cluster synchronization in the complex networks with nonidentical nonlinear dynamics is considered. By Lyapunov functional and M-matrix theory, some sufficient conditions for cluster synchronization are obtained. Moreover, the least number of nodes which should be pinned is given. It is shown that when the root nodes of all the clusters are pinning-controlled, cluster synchronization with adaptive coupling strength can be achieved. Different from the constraints of many literatures, the assumption is that each row sum for all diagonal submatrices of the Laplacian matrix is equal to zero. Finally, a numerical simulation in the network with three scale-free subnetwork is provided to demonstrate the effectiveness of the theoretical results. © 2016 Wiley Periodicals, Inc. Complexity 21: 380–387, 2016