pith. sign in

arxiv: 1803.02793 · v2 · pith:ELT6KP3Nnew · submitted 2018-03-07 · 💻 cs.SY

Topology Learning of Radial Dynamical Systems with Latent Nodes

classification 💻 cs.SY
keywords topologynodesalgorithmdynamicalmethodnetworkobservedradial
0
0 comments X
read the original abstract

In this article, we present a method to reconstruct the topology of a partially observed radial network of linear dynamical systems with bi-directional interactions. Our approach exploits the structure of the inverse power spectral density matrix and recovers edges involving nodes up to four hops away in the underlying topology. We then present an algorithm with provable guarantees, which eliminates the spurious links obtained and also identifies the location of the unobserved nodes in the inferred topology. The algorithm recovers the exact topology of the network by using only time-series of the states at the observed nodes. The effectiveness of the method developed is demonstrated by applying it on a typical distribution system of the electric grid.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.