Connecting the Dots: Identifying Network Structure via Graph Signal Processing
Reads0
Chats0
TLDR
Graph signal processing (GSP) has been widely used to infer the underlying graph topology as discussed by the authors, where correlation analysis takes center stage along with its connections to covariance selection and high dimensional regression for learning Gaussian graphical models.Abstract:
Network topology inference is a significant problem in network science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known and then analyze how the graph?s algebraic and spectral characteristics impact the properties of the graph signals of interest. Such an assumption is often untenable beyond applications dealing with, e.g., directly observable social and infrastructure networks; and typically adopted graph construction schemes are largely informal, distinctly lacking an element of validation. This article offers an overview of graph-learning methods developed to bridge the aforementioned gap, by using information available from graph signals to infer the underlying graph topology. Fairly mature statistical approaches are surveyed first, where correlation analysis takes center stage along with its connections to covariance selection and high-dimensional regression for learning Gaussian graphical models. Recent GSP-based network inference frameworks are also described, which postulate that the network exists as a latent underlying structure and that observations are generated as a result of a network process defined in such a graph. A number of arguably more nascent topics are also briefly outlined, including inference of dynamic networks and nonlinear models of pairwise interaction, as well as extensions to directed (di) graphs and their relation to causal inference. All in all, this article introduces readers to challenges and opportunities for SP research in emerging topic areas at the crossroads of modeling, prediction, and control of complex behavior arising in networked systems that evolve over time.read more
Citations
More filters
Journal ArticleDOI
Topological Signal Processing Over Simplicial Complexes
TL;DR: A sampling theory for signals of any order is derived, a method to infer the topology of a simplicial complex from data is proposed and applications to traffic analysis over wireless networks and to the processing of discrete vector fields are illustrated to illustrate the benefits of the proposed methodologies.
Journal ArticleDOI
Feature Graph Learning for 3D Point Cloud Denoising
TL;DR: This work alternately optimize the diagonal and off-diagonal entries of a Mahalanobis distance matrix and constrain the Schur complement of sub-matrix to be positive definite (PD) via linear inequalities derived from the Gershgorin circle theorem.
Posted Content
Differentiable Graph Module (DGM) Graph Convolutional Networks.
TL;DR: Differentiable Graph Module is introduced, a learnable function that predicts edge probabilities in the graph which are optimal for the downstream task which can be combined with convolutional graph neural network layers and trained in an end-to-end fashion.
Journal ArticleDOI
Graph signal processing for machine learning: A review and new perspectives.
TL;DR: In this paper, a review of the contributions made by Graph Signal Processing (GSP) concepts and tools, such as graph filters and transforms, to the development of novel machine learning algorithms is presented.
Journal ArticleDOI
Accuracy-diversity trade-off in recommender systems via graph convolutions
TL;DR: A model that learns from a nearest neighbor and a furthest neighbor graph via a joint convolutional model to establish a novel accuracy-diversity trade-off for recommender systems is developed, showing diversity gains up to seven times by trading as little as 1\% in accuracy.
References
More filters
Journal ArticleDOI
Investigating Causal Relations by Econometric Models and Cross-Spectral Methods
TL;DR: In this article, the cross spectrum between two variables can be decomposed into two parts, each relating to a single causal arm of a feedback situation, and measures of causal lag and causal strength can then be constructed.
Book ChapterDOI
Investigating causal relations by econometric models and cross-spectral methods
TL;DR: In this article, it is shown that the cross spectrum between two variables can be decomposed into two parts, each relating to a single causal arm of a feedback situation, and measures of causal lag and causal strength can then be constructed.
Journal ArticleDOI
Sparse inverse covariance estimation with the graphical lasso
TL;DR: Using a coordinate descent procedure for the lasso, a simple algorithm is developed that solves a 1000-node problem in at most a minute and is 30-4000 times faster than competing methods.
BookDOI
New Introduction to Multiple Time Series Analysis
TL;DR: This reference work and graduate level textbook considers a wide range of models and methods for analyzing and forecasting multiple time series, which include vector autoregressive, cointegrated, vector Autoregressive moving average, multivariate ARCH and periodic processes as well as dynamic simultaneous equations and state space models.
Journal ArticleDOI
High-dimensional graphs and variable selection with the Lasso
TL;DR: It is shown that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs and is hence equivalent to variable selection for Gaussian linear models.