.png){kind=icon}
.png){kind=icon}
Return
Controllability of Hypergraphs
.png){kind=icon}
OA
AI
DOI：10.1109/TNSE.2021.3068203.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En
In this paper, we develop a notion of controllability for hypergraphs via tensor algebra and polynomial control theory. Inspired by uniform hypergraphs, we propose a new tensor-based multilinear dynamical system representation, and derive a Kalman-rank-like condition to determine the minimum number of control nodes (MCN) needed to achieve controllability of even uniform hypergraphs. We present an efficient heuristic to obtain the MCN. MCN can be used as a measure of robustness, and we show that it is related to the hypergraph degree distribution in simulated examples. Finally, we use MCN to examine robustness in real biological networks.
Keywords:
Tensors
Controllability
Robustness
Algebra
Standards
Nonhomogeneous media
Genomics
Biological networks
controllability
hypergraphs
pattern recognition
robustness
tensors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K