Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.13345 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911191426662400 |
|---|---|
| author | Umezu, Kota Sato, Kazuhiro |
| author_facet | Umezu, Kota Sato, Kazuhiro |
| contents | For large-scale network systems, network centrality based on control theory plays a crucial role in understanding their properties and controlling them efficiently. The controllability score is such a centrality index and can give a physically meaningful measure. It is originally proposed for linear time-invariant (LTI) systems, and we extend it to linear time-varying (LTV) systems in this paper. Since the controllability score is defined as an optimal solution to some optimization problem, it is not necessarily uniquely determined. Its uniqueness must be guaranteed for reproducibility and interpretability. In this paper, we show its uniqueness in almost all cases, which guarantees its use as a network centrality measure. We also prove its continuity with respect to the time parameters. In addition, we propose a data-driven method to compute it. Finally, we verify the effectiveness of the extension and examine the performance of the data-driven method through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_13345 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Controllability scores of linear time-varying network systems Umezu, Kota Sato, Kazuhiro Optimization and Control For large-scale network systems, network centrality based on control theory plays a crucial role in understanding their properties and controlling them efficiently. The controllability score is such a centrality index and can give a physically meaningful measure. It is originally proposed for linear time-invariant (LTI) systems, and we extend it to linear time-varying (LTV) systems in this paper. Since the controllability score is defined as an optimal solution to some optimization problem, it is not necessarily uniquely determined. Its uniqueness must be guaranteed for reproducibility and interpretability. In this paper, we show its uniqueness in almost all cases, which guarantees its use as a network centrality measure. We also prove its continuity with respect to the time parameters. In addition, we propose a data-driven method to compute it. Finally, we verify the effectiveness of the extension and examine the performance of the data-driven method through numerical experiments. |
| title | Controllability scores of linear time-varying network systems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2501.13345 |