TY - JOUR

T1 - Necessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks

AU - van Waarde, Henk

AU - Tesi, Pietro

AU - Camlibel, Kanat

PY - 2020/11

Y1 - 2020/11

N2 - 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.

AB - 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.

U2 - 10.1109/TAC.2019.2957345

DO - 10.1109/TAC.2019.2957345

M3 - Article

VL - 65

SP - 4525

EP - 4537

JO - IEEE-Transactions on Automatic Control

JF - IEEE-Transactions on Automatic Control

SN - 0018-9286

IS - 11

ER -