Controllability of Cartesian Product Signed Networks
研究了由两个因子网络通过笛卡尔积构成的复合符号网络的可控性，给出了可控性的充要代数条件，并发现可通过因子网络的结构平衡和状态轨迹来推断复合网络的性质，从而减少计算量。
A necessary and sufficient algebraic condition is obtained for the controllability of a composite signed network consisting of two factor networks by Cartesian product, which reveals how the controllability of the higher-dimensional Cartesian product network is affected by the controllability of its smaller-scale low-dimensional factor networks. Furthermore, the structural balance of the Cartesian product network can be judged by the structural balance of its factor networks, which can greatly reduce amount of calculation to some extent. And the agents’ state evolution trajectories of Cartesian product networks can also be predicted by those of their factor networks. Moreover, the controllability of general signed networks is considered. Algorithms and numerical examples are exhibited to demonstrate the validity of our methods.