Observability of Hypergraphs
From MaRDI portal
Abstract: In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs are generalizations of graphs in which edges may connect any number of nodes, thereby representing multi-way relationships which are ubiquitous in many real-world networks including neuroscience, social networks, and bioinformatics. We define a canonical multilinear dynamical system with linear outputs on uniform hypergraphs which captures such multi-way interactions and results in a homogeneous polynomial system. We derive a Kalman-rank-like condition for assessing the local weak observability of this resulting system and propose techniques for its efficient computation. We also propose a greedy heuristic to determine the minimum set of observable nodes, and demonstrate our approach numerically on different hypergraph topologies, and hypergraphs derived from an experimental biological dataset.
This page was built for publication: Observability of Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6432691)
