Bo Liu;Mengjie Hu;Junjie Huang;Qiang Zhang;Yin Chen;Housheng Su
{"title":"Discrete-Time Controllability of Cartesian Product Networks","authors":"Bo Liu;Mengjie Hu;Junjie Huang;Qiang Zhang;Yin Chen;Housheng Su","doi":"10.1109/TSIPN.2024.3487411","DOIUrl":null,"url":null,"abstract":"This work studies the discrete-time controllability of a composite network formed by factor networks via Cartesian products. Based on the Popov-Belevitch-Hautus test and properties of Cartesian products, we derive the algebra-theoretic necessary and sufficient conditions for the controllability of the Cartesian product network (CPN), which is devoted to carry out a comprehensive study of the intricate interplay between the node-system dynamics, network topology and the controllability of the CPN, especially the intrinsic connection between the CPN and its factors. This helps us enrich and perfect the theoretical framework of controllability of complex networks, and gives new insight into designing a valid control scheme for larger-scale composite networks.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"868-880"},"PeriodicalIF":3.0000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10745771/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0
Abstract
This work studies the discrete-time controllability of a composite network formed by factor networks via Cartesian products. Based on the Popov-Belevitch-Hautus test and properties of Cartesian products, we derive the algebra-theoretic necessary and sufficient conditions for the controllability of the Cartesian product network (CPN), which is devoted to carry out a comprehensive study of the intricate interplay between the node-system dynamics, network topology and the controllability of the CPN, especially the intrinsic connection between the CPN and its factors. This helps us enrich and perfect the theoretical framework of controllability of complex networks, and gives new insight into designing a valid control scheme for larger-scale composite networks.
期刊介绍：
The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
