Observability of Hypergraphs
Preprint
Abstract
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in many real-world networks. We extend the canonical homogeneous polynomial or multilinear dynamical system on uniform hypergraphs to include linear outputs, and we derive a Kalman-rank-like condition for assessing the local weak observability. We propose an exact techniques for determining the local observability criterion, and we propose a greedy heuristic to determine the minimum set of observable nodes. Numerical experiments demonstrate our approach on several hypergraph topologies and a hypergraph representations of neural networks within the mouse hypothalamus.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Hypergraph Similarity MeasuresIEEE Transactions on Network Science and Engineering, 2022
- Network dynamics of hypothalamic feeding neuronsProceedings of the National Academy of Sciences, 2021
- Controllability of HypergraphsIEEE Transactions on Network Science and Engineering, 2021
- Observability of Network Systems: A Critical Review of Recent ResultsJournal of Control, Automation and Electrical Systems, 2020
- Networks beyond pairwise interactions: Structure and dynamicsPhysics Reports, 2020
- Tensor Entropy for Uniform HypergraphsIEEE Transactions on Network Science and Engineering, 2020
- Particle filtering of dynamical networks: Highlighting observability issuesChaos: An Interdisciplinary Journal of Nonlinear Science, 2019
- Analysis and application of neuronal network controllability and observabilityChaos: An Interdisciplinary Journal of Nonlinear Science, 2017
- Block Tensor UnfoldingsSIAM Journal on Matrix Analysis and Applications, 2012
- Exploring complex networksNature, 2001