# A Necessary Condition for Network Identifiability with Partial Excitation and Measurement

@inproceedings{Cheng2021ANC, title={A Necessary Condition for Network Identifiability with Partial Excitation and Measurement}, author={Xiaodong Cheng and Shengling Shi and Ioannis Lestas and Paul M. J. Van den Hof}, year={2021} }

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…

## 2 Citations

### Generic identifiability of subnetworks in a linear dynamic network: the full measurement case

- MathematicsAutom.
- 2022

### Single module identifiability in linear dynamic networks with partial excitation and measurement

- MathematicsIEEE Transactions on Automatic Control
- 2021

This work introduces a novel network model structure such that excitation from unmeasured noise signals is included, which leads to less conservative identifiability conditions than relying on measured excitation signals only.

## References

SHOWING 1-10 OF 24 REFERENCES

### Allocation of Excitation Signals for Generic Identifiability of Dynamic Networks

- Computer Science2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019

It is shown that generic identifiability of a directed network is related to the existence of a set of disjoint directed pseudo-trees that cover all the edges of the underlying graph, based on which, an excitation allocation problem is studied, aiming to select the minimal number excitation signals to achieve the generic identIFiability of the whole network.

### Local Network Identifiability with Partial Excitation and Measurement

- Computer Science, Mathematics2020 59th IEEE Conference on Decision and Control (CDC)
- 2020

It is shown that local identifiability is a generic property, a necessary and sufficient condition in terms of matrix generic ranks, and an algorithm to develop an algorithm determining, with probability 1, which transfer functions are locally identifiable.

### Network identification with partial excitation and measurement

- Computer Science, Mathematics2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019

The question addressed in this paper is to determine what is the input/output information that must be acquired in order to identify a network of dynamical systems, or part of such network. More…

### Necessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks

- Mathematics, Computer ScienceIEEE Transactions on Automatic Control
- 2020

A new graph-theoretic concept called the graph simplification process is introduced, which provides necessary and sufficient topological conditions for identifiability of 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.

### Identifiability of Dynamical Networks With Partial Node Measurements

- Computer ScienceIEEE Transactions on Automatic Control
- 2019

This paper presents the first results for the situation where not all node signals are measurable, under the assumptions that, first, the topology of the network is known, and, second, each node is excited by a known external excitation.

### Generic identifiability of subnetworks in a linear dynamic network: the full measurement case

- MathematicsAutom.
- 2022

### Single module identifiability in linear dynamic networks with partial excitation and measurement

- MathematicsIEEE Transactions on Automatic Control
- 2021

This work introduces a novel network model structure such that excitation from unmeasured noise signals is included, which leads to less conservative identifiability conditions than relying on measured excitation signals only.

### Allocation of Excitation Signals for Generic Identifiability of Linear Dynamic Networks

- Computer ScienceIEEE Transactions on Automatic Control
- 2022

The proposed approach can be adapted using the notion of antipseudotrees to solve a dual problem, which is to select a minimal number of measurement signals for generic identifiability of the overall network, under the assumption that all the vertices are excited.

### Identifiability of dynamical networks: Which nodes need be measured?

- Computer Science2017 IEEE 56th Annual Conference on Decision and Control (CDC)
- 2017

This paper presents the first results for the situation where not all node signals are measurable, under the assumptions that the topology of the network is known, that each node is excited by a known signal and that the nodes are noise-free.