Controllability of Hypergraphs

Abstract

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.

12 pages, 9 figures, 1 table, IEEE Transactions on Network Science and Engineering, accepted to appear

References in corpus (12)

• Classes of behavior of small-world networks
• Network robustness and fragility: Percolation on random graphs
• Control Principles of Complex Networks
• Exact Controllability of Complex Networks
• Structure-based control of complex networks with nonlinear dynamics
• Social contagion models on hypergraphs
• Control of complex networks requires both structure and dynamics
• The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
• Spectra of general hypergraphs
• Tensor Entropy for Uniform Hypergraphs
• Multilinear Time Invariant System Theory
• Visual Analytics for Temporal Hypergraph Model Exploration

Cited by in corpus (6)

• Hypergraph reconstruction from dynamics
• Explicit Solutions and Stability Properties of Homogeneous Polynomial Dynamical Systems
• Collective dynamics on higher-order networks
• Hypergraph Analysis Toolbox for Chromosome Conformation
• Pinning control of chimera states in systems with higher-order interactions
• On the efficiency of pairwise Hamiltonian control to desynchronize the higher-order Kuramoto model