Book ; Online: Observability of Hypergraphs
2023
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- ... ...
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. Comment: 7 pages, 3 figures, 2 algorithms, lots of math! |
---|---|
Keywords | Mathematics - Dynamical Systems ; Electrical Engineering and Systems Science - Systems and Control |
Subject code | 006 |
Publishing date | 2023-04-10 |
Publishing country | us |
Document type | Book ; Online |
Database | BASE - Bielefeld Academic Search Engine (life sciences selection) |
Full text online
More links
Kategorien
Inter-library loan at ZB MED
Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.