Learning the exact topology of undirected consensus networks

@article{Talukdar2017LearningTE,
  title={Learning the exact topology of undirected consensus networks},
  author={Saurav Talukdar and Deepjyoti Deka and Sandeep Attree and Donatello Materassi and Murti V. Salapaka},
  journal={2017 IEEE 56th Annual Conference on Decision and Control (CDC)},
  year={2017},
  pages={5784-5789}
}
In this article, we present a method to learn the interaction topology of a network of agents undergoing linear consensus updates in a non invasive manner. Our approach is based on multivariate Wiener filtering, which is known to recover spurious edges apart from the true edges in the topology. The main contribution of this work is to show that in the case of undirected consensus networks, all spurious links obtained using Wiener filtering can be identified using frequency response of the… 

Figures from this paper

Topology Learning of Linear Dynamical Systems With Latent Nodes Using Matrix Decomposition

A novel approach to reconstruct the topology of networked linear dynamical systems with latent nodes by relying on the unique decomposition of the inverse of power spectral density matrix obtained from observed nodes as a sum of sparse and low-rank matrices.

Representation and Reconstruction of Linear, Time-Invariant Networks

The ultimate objective of this dissertation is to develop algorithms capable of reconstructing proper networks, and this objective will be addressed in three parts, which lays the foundation for the theory of mathematical representations of proper networks.

Data-Driven Identification of a Thermal Network in Multi-Zone Building

It is demonstrated that the learning algorithm accurately reconstructs the interaction topology for a 5 zone office building in EnergyPlus with real-world conditions and is able to recover the network structure in scenarios where prior research prove insufficient.

References

SHOWING 1-10 OF 30 REFERENCES

Topology Identification of Directed Dynamical Networks via Power Spectral Analysis

This work proposes several reconstruction algorithms by measuring the cross-power spectral densities of the network response to the input noises, and proposes specialized algorithms that result in a lower computational cost for nonreciprocal networks and undirected networks.

A distributed solution to the network reconstruction problem

Exact Network Reconstruction from Consensus Signals and One Eigenvalue

This paper uses an high frequency noise to reconstruct a network of technological agents whose graph is unknown, communicating by means of a consensus protocol, and combines these two techniques in order to simplify calculations and avoid topological reconstruction errors.

Centrality Measures in Linear Consensus Networks With Structured Network Uncertainties

This paper proposes new insights into the network centrality based not only on the network graph, but also on a more structured model of network uncertainties, where the network uncertainty is modeled by structured additive Gaussian white noise input on the update dynamics of each agent.

Decentralized Laplacian Eigenvalues Estimation and Collaborative Network Topology Identification

In this paper we first study observability conditions on networks. Based on spectral properties of graphs, we state new sufficient or necessary conditions for observability. These conditions are

Network Identification via Node Knockout

This paper proposes a node-knockout procedure for the complete characterization of the interaction geometry in consensus-type networks, and provides an example for the utility of such a network identification process in the context of fault detection for networked systems.

On the Problem of Reconstructing an Unknown Topology via Locality Properties of the Wiener Filter

A methodology for identifying the interrelatedness structure of dynamically related time series data is presented that also allows for the presence of loops in the connectivity structure and it is shown that when the linear dynamic graph is allowed to admit non-causal weights, then the links structure can be recovered with the possibility of identifying spurious connections.

Max-Min Algorithm for Distributed Finite Time Termination of Consensus in Presence of Delays

This work presents a novel maximum-minimum consensus based distributed protocol where each node detects when it is within a pre-specified margin of the consensus value under the presence of uncertainty in the communication protocol.

Distributed average consensus with least-mean-square deviation

Necessary and Sufficient Conditions for Dynamical Structure Reconstruction of LTI Networks

This paper formulates and solves the network reconstruction problem for linear time-invariant systems and completely characterize this additional information that is essential for dynamical reconstruction without appeal to ad-hoc assumptions about the network.