Average Controllability of Cartesian Product Networks

This article explores the average controllability of composite networks generated by factor networks via Cartesian product from energy control perspective, which can be characterized by the controllability Gramian-based metrics. The considered factors are directed weighted networks with diagonalizable / non-diagonalizbable Laplacian dynamics. It is shown that the average controllability of a composite network is determined by the spectral properties of its factors without calculating its own high-dimensional matrix, which reveals how the energy-related controllability of a Cartesian product network (CPN) can be derived from its factors’ features. This will reduce the computational complexity and provide insights to study the energy control of other graph product networks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Circuits and Systems I Regular Papers
Published
2025-04-04
DOI
https://doi.org/10.1109/tcsi.2025.3554158
Primary Topic
Product Development and Customization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Average Controllability of Cartesian Product Networks

Housheng Su, Alatancang Chen, Junjie Huang, Bo Liu et al.
IEEE Transactions on Circuits and Systems I Regular Papers
Product Development and Customization
article

Average Controllability of Cartesian Product Networks

Housheng Su, Alatancang Chen, Junjie Huang, Bo Liu, Qiang Zhang
article en

Abstract

This article explores the average controllability of composite networks generated by factor networks via Cartesian product from energy control perspective, which can be characterized by the controllability Gramian-based metrics. The considered factors are directed weighted networks with diagonalizable / non-diagonalizbable Laplacian dynamics. It is shown that the average controllability of a composite network is determined by the spectral properties of its factors without calculating its own high-dimensional matrix, which reveals how the energy-related controllability of a Cartesian product network (CPN) can be derived from its factors’ features. This will reduce the computational complexity and provide insights to study the energy control of other graph product networks.

IEEE Transactions on Circuits and Systems I Regular PapersVol. 72(10)
Ministry of Education of the People's Republic of China (CN), Minzu University of China (CN), Inner Mongolia University (CN), Ministry of Education (ME), Huazhong University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 91%
Product Development and Customization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Average Controllability of Cartesian Product Networks — Housheng Su, Alatancang Chen, et al. · IEEE Transactions on Circuits and Systems I Regular Papers (2025) | TGRS Research Map | TGRS