Joint Inference of Multiple Graphs from Matrix Polynomials
arXiv:2010.08120
Abstract
Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph and motivated by social and biological networks, we study the problem of jointly inferring multiple graphs from the observation of signals at their nodes (graph signals), which are assumed to be stationary in the sought graphs. From a mathematical point of view, graph stationarity implies that the mapping between the covariance of the signals and the sparse matrix representing the underlying graph is given by a matrix polynomial. A prominent example is that of Markov random fields, where the inverse of the covariance yields the sparse matrix of interest. From a modeling perspective, stationary graph signals can be used to model linear network processes evolving on a set of (not necessarily known) networks. Leveraging that matrix polynomials commute, a convex optimization method along with sufficient conditions that guarantee the recovery of the true graphs are provided when perfect covariance information is available. Particularly important from an empirical viewpoint, we provide high-probability bounds on the recovery error as a function of the number of signals observed and other key problem parameters. Numerical experiments using synthetic and real-world data demonstrate the effectiveness of the proposed method with perfect covariance information as well as its robustness in the noisy regime.
arXiv comment13 pages, 2 figures
References in corpus (15)
- Discrete Signal Processing on Graphs
- Learning graphs from data: A signal representation perspective
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Stationary signal processing on graphs
- Stationary Graph Processes and Spectral Estimation
- Brain covariance selection: better individual functional connectivity models using population prior
- Kernel-Based Structural Equation Models for Topology Identification of Directed Networks
- Blind Identification of Graph Filters
- Multilayer weighted social network model
- One condition for solution uniqueness and robustness of both l1-synthesis and l1-analysis minimizations
- Multi-layer graph analysis for dynamic social networks
- Tracking Switched Dynamic Network Topologies from Information Cascades
- Inference for multiple heterogeneous networks with a common invariant subspace
- Network Inference from Consensus Dynamics with Unknown Parameters
- High dimensional Sparse Gaussian Graphical Mixture Model