Joint Inference of Multiple Graphs from Matrix Polynomials
Madeline Navarro, Yuhao Wang, Antonio G. Marques, Caroline Uhler,, Santiago Segarra

TL;DR
This paper introduces a convex optimization approach for jointly inferring multiple stationary graphs from observed signals, providing theoretical guarantees and demonstrating effectiveness on synthetic and real data.
Contribution
It develops a novel convex method for joint graph inference from multiple signals, leveraging matrix polynomial properties and offering recovery guarantees.
Findings
Successful recovery of true graphs with perfect covariance information
Robustness of the method in noisy conditions
High-probability bounds on recovery error
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Brain Connectivity Studies · Complex Network Analysis Techniques · Advanced Graph Neural Networks
