Blind Demixing of Diffused Graph Signals
arXiv:2012.13301
Abstract
Using graphs to model irregular information domains is an effective approach to deal with some of the intricacies of contemporary (network) data. A key aspect is how the data, represented as graph signals, depend on the topology of the graph. Widely-used approaches assume that the observed signals can be viewed as outputs of graph filters (i.e., polynomials of a matrix representation of the graph) whose inputs have a particular structure. Diffused graph signals, which correspond to an originally sparse (node-localized) signal percolated through the graph via filtering, fall into this class. In that context, this paper deals with the problem of jointly identifying graph filters and separating their (sparse) input signals from a mixture of diffused graph signals, thus generalizing to the graph signal processing framework the classical blind demixing (blind source separation) of temporal and spatial signals. We first consider the scenario where the supporting graphs are different across the signals, providing a theorem for demixing feasibility along with probabilistic bounds on successful recovery. Additionally, an analysis of the degenerate problem of demixing with a single graph is also presented. Numerical experiments with synthetic and real-world graphs empirically illustrating the main theoretical findings close the paper.
arXiv comment13 pages, 3 figures, journal article submitted to TSP
References in corpus (14)
- Statistical mechanics of complex networks
- Cooperative Game Theory Approaches for Network Partitioning
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Geometric deep learning: going beyond Euclidean data
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Open Graph Benchmark: Datasets for Machine Learning on Graphs
- Convolutional Neural Network Architectures for Signals Supported on Graphs
- Sampling of graph signals with successive local aggregations
- Stationary Graph Processes and Spectral Estimation
- Advances in Distributed Graph Filtering
- Blind Identification of Graph Filters
- Network Inference from Consensus Dynamics with Unknown Parameters