Signal Processing on Directed Graphs
arXiv:2008.00586
Abstract
This paper provides an overview of the current landscape of signal processing (SP) on directed graphs (digraphs). Directionality is inherent to many real-world (information, transportation, biological) networks and it should play an integral role in processing and learning from network data. We thus lay out a comprehensive review of recent advances in SP on digraphs, offering insights through comparisons with results available for undirected graphs, discussing emerging directions, establishing links with related areas in machine learning and causal inference in statistics, as well as illustrating their practical relevance to timely applications. To this end, we begin by surveying (orthonormal) signal representations and their graph frequency interpretations based on novel measures of signal variation for digraphs. We then move on to filtering, a central component in deriving a comprehensive theory of SP on digraphs. Indeed, through the lens of filter-based generative signal models, we explore a unified framework to study inverse problems (e.g., sampling and deconvolution on networks), statistical analysis of random signals, and topology inference of digraphs from nodal observations.
To be published in the IEEE Signal Processing Magazine Special Issue on Graph Signal Processing
References in corpus (19)
- 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
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Connecting the Dots: Identifying Network Structure via Graph Signal Processing
- Convolutional Neural Network Architectures for Signals Supported on Graphs
- Signal Recovery on Graphs: Variation Minimization
- Sampling of graph signals with successive local aggregations
- Signal Processing on Graphs: Causal Modeling of Unstructured Data
- Causal Network Inference via Group Sparse Regularization
- On the Graph Fourier Transform for Directed Graphs
- Advances in Distributed Graph Filtering
- Reconstruction of Graph Signals through Percolation from Seeding Nodes
- Kernel-Based Structural Equation Models for Topology Identification of Directed Networks
- Blind Identification of Graph Filters
- Approximate fast graph Fourier transforms via multi-layer sparse approximations
- Spectral Projector-Based Graph Fourier Transforms
- A Directed Graph Fourier Transform with Spread Frequency Components
- Invariance-Preserving Localized Activation Functions for Graph Neural Networks