Online Inference for Mixture Model of Streaming Graph Signals with Non-White Excitation

Abstract

This paper considers a joint multi-graph inference and clustering problem for simultaneous inference of node centrality and association of graph signals with their graphs. We study a mixture model of filtered low pass graph signals with possibly non-white and low-rank excitation. While the mixture model is motivated from practical scenarios, it presents significant challenges to prior graph learning methods. As a remedy, we consider an inference problem focusing on the node centrality of graphs. We design an expectation-maximization (EM) algorithm with a unique low-rank plus sparse prior derived from low pass signal property. We propose a novel online EM algorithm for inference from streaming data. As an example, we extend the online algorithm to detect if the signals are generated from an abnormal graph. We show that the proposed algorithms converge to a stationary point of the maximum-a-posterior (MAP) problem. Numerical experiments support our analysis.

References in corpus (9)

• Discrete Signal Processing on Graphs
• Sampling Signals on Graphs: From Theory to Applications
• A User Guide to Low-Pass Graph Signal Processing and its Applications
• A Unified Framework for Structured Graph Learning via Spectral Constraints
• Tracking Switched Dynamic Network Topologies from Information Cascades
• Joint Inference of Multiple Graphs from Matrix Polynomials
• Detecting Central Nodes from Low-rank Excited Graph Signals via Structured Factor Analysis
• Blind Inference of Eigenvector Centrality Rankings
• Online Graph Learning from Social Interactions