Discrete-time controllability of Cartesian product networks

Tools

Liu, Bo and Hu, Mengjie and Huang, Junjie and Zhang, Qiang and Chen, Yin and Su, Housheng (2024) Discrete-time controllability of Cartesian product networks. IEEE Transactions on Signal and Information Processing over Networks, 10. pp. 868-880. ISSN 2373-7778 (https://doi.org/10.1109/tsipn.2024.3487411)

[thumbnail of Liu-etal-Discrete-time-controllability-of-Cartesian-product-networks]
Preview
 Text. Filename: Liu-etal-Discrete-time-controllability-of-Cartesian-product-networks.pdf
Accepted Author Manuscript
Download (4MB)| Preview

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.

ORCID iDs

Liu, Bo, Hu, Mengjie, Huang, Junjie, Zhang, Qiang, Chen, Yin ORCID logoORCID: https://orcid.org/0000-0002-3351-5065 and Su, Housheng;
CORE (COnnecting REpositories)