Necessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks

Henk van Waarde*, Pietro Tesi, Kanat Camlibel

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)
16 Downloads (Pure)

Abstract

This article deals with dynamical networks in which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions for identifiability of such dynamical networks, where we assume that only a subset of nodes is measured but the underlying graph structure of the network is known. This problem has recently been investigated from a generic viewpoint. Roughly speaking, generic identifiability means that the transfer functions in the network can be identified for “almost all” network matrices associated with the graph. In this article, we investigate the stronger notion of identifiability for all network matrices. To this end, we introduce a new graph-theoretic concept called the graph simplification process. Based on this process, we provide necessary and sufficient topological conditions for identifiability. Notably, we also show that these conditions can be verified by polynomial time algorithms. Finally, we explain how our results generalize existing sufficient conditions for identifiability.
Original languageEnglish
Pages (from-to)4525-4537
Number of pages13
JournalIEEE Transactions on Automatic Control
Volume65
Issue number11
DOIs
Publication statusPublished - Nov-2020

Cite this