A Necessary Condition for Network Identifiability with Partial Excitation and Measurement

Xiaodong Cheng, Shengling Shi, Ioannis Lestas, Paul M. J. Van den Hof

Published 2021-05-07Version 1

This paper considers dynamic networks where vertices and edges represent manifest signals and causal dependencies among the signals, respectively. We address the problem of how to determine if the dynamics of a network can be identified when only partial vertices are measured and excited. A necessary condition for network identifiability is presented, where the analysis is performed based on identifying the dependency of a set of rational functions from excited vertices to measured ones. This condition is further characterised by using an edge-removal procedure on the associated bipartite graph. Moreover, on the basis of necessity analysis, we provide a necessary and sufficient condition for identifiability in circular networks.