Network Inference from Consensus Dynamics

Abstract

We consider the problem of identifying the topology of a weighted, undirected network $\mathcal{G}$ from observing snapshots of multiple independent consensus dynamics. Specifically, we observe the opinion profiles of a group of agents for a set of $M$ independent topics and our goal is to recover the precise relationships between the agents, as specified by the unknown network $\mathcal{G}$. In order to overcome the under-determinacy of the problem at hand, we leverage concepts from spectral graph theory and convex optimization to unveil the underlying network structure. More precisely, we formulate the network inference problem as a convex optimization that seeks to endow the network with certain desired properties -- such as sparsity -- while being consistent with the spectral information extracted from the observed opinions. This is complemented with theoretical results proving consistency as the number $M$ of topics grows large. We further illustrate our method by numerical experiments, which showcase the effectiveness of the technique in recovering synthetic and real-world networks.

Will be presented at the 2017 IEEE Conference on Decision and Control (CDC)

References in corpus (2)

• Revealing networks from dynamics: an introduction
• Network Structure Inference, A Survey: Motivations, Methods, and Applications

Cited by in corpus (6)

• Network Inference from Consensus Dynamics with Unknown Parameters
• Exact Blind Community Detection from Signals on Multiple Graphs
• Local Tomography of Large Networks under the Low-Observability Regime
• Recovering the Graph Underlying Networked Dynamical Systems under Partial Observability: A Deep Learning Approach
• On Inference of Network Topology and Confirmation Bias in Cyber-Social Networks
• Network Weight Estimation for Binary-Valued Observation Models