# Vertex-Frequency Analysis on Graphs

arXiv: https://arxiv.org/abs/1307.5708 · HTML: https://mlsanity.com/paper/1307.5708/

## Key facts

- Cited by 24 papers in the map (data through 7 Oct 2026).
- First posted on arXiv 22 Jul 2013.

## Built on by (most cited first, 24 of 24)

- [Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?](https://mlsanity.com/paper/2206.01506/) (2022)
- [Node-oriented Spectral Filtering for Graph Neural Networks](https://mlsanity.com/paper/2212.03654/) (2022)
- [Deep Graph Convolutional Reinforcement Learning for Financial Portfolio Management -- DeepPocket](https://mlsanity.com/paper/2105.08664/) (2021)
- [MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs](https://mlsanity.com/paper/2110.07570/) (2021)
- [Multiscale Graph Comparison via the Embedded Laplacian Discrepancy](https://mlsanity.com/paper/2201.12064/) (2022)
- [Automatic Landmark Detection and Registration of Brain Cortical Surfaces via Quasi-Conformal Geometry and Convolutional Neural Networks](https://mlsanity.com/paper/2208.07010/) (2022)
- [Clenshaw Graph Neural Networks](https://mlsanity.com/paper/2210.16508/) (2022)
- [Learning Product Graphs from Spectral Templates](https://mlsanity.com/paper/2211.02893/) (2022)
- [ProductGraphSleepNet: Sleep Staging using Product Spatio-Temporal Graph Learning with Attentive Temporal Aggregation](https://mlsanity.com/paper/2212.04881/) (2022)
- [Computing Steiner Trees using Graph Neural Networks](https://mlsanity.com/paper/2108.08368/) (2021)
- [Prediction and Interpretation of Vehicle Trajectories in the Graph Spectral Domain](https://mlsanity.com/paper/2309.16702/) (2023)
- [Network representation learning: A macro and micro view](https://mlsanity.com/paper/2111.10772/) (2021)
- [Deep representation learning: Fundamentals, Perspectives, Applications, and Open Challenges](https://mlsanity.com/paper/2211.14732/) (2022)
- [HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network](https://mlsanity.com/paper/2402.09676/) (2024)
- [Kernel-Based Models for Influence Maximization on Graphs based on Gaussian Process Variance Minimization](https://mlsanity.com/paper/2103.01575/) (2021)
- [Extending compositional data analysis from a graph signal processing perspective](https://mlsanity.com/paper/2201.10610/) (2022)
- [Windowed Fourier Analysis for Signal Processing on Graph Bundles](https://mlsanity.com/paper/2302.05592/) (2023)
- [Locally Stationary Graph Processes](https://mlsanity.com/paper/2309.01657/) (2023)
- [GSpect: Spectral Filtering for Cross-Scale Graph Classification](https://mlsanity.com/paper/2409.00338/) (2024)
- [From ChebNet to ChebGibbsNet](https://mlsanity.com/paper/2412.01789/) (2024)
- [Enhancing Swarms Durability to Threats via Graph Signal Processing and GNN-based Generative Modeling](https://mlsanity.com/paper/2507.03039/) (2025)
- [Data-Driven Graph Filters via Adaptive Spectral Shaping](https://mlsanity.com/paper/2602.03698/) (2026)
- [The Laplacian Keyboard: Beyond the Linear Span](https://mlsanity.com/paper/2602.07730/) (2026)
- [QuantumPhaseNet: A Gauge-Covariant Geometric and Quantum-Spectral Theory of Semantic Concept Hierarchies with Prototype Validation of a Classical Quantum-Inspired Model](https://mlsanity.com/paper/2608.15820/) (2026)

## Abstract (arXiv)

One of the key challenges in the area of signal processing on graphs is to design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs. To do so, we need to account for the intrinsic geometric structure of the underlying graph data domain. In this paper, we generalize one of the most important signal processing tools - windowed Fourier analysis - to the graph setting. Our approach is to first define generalized convolution, translation, and modulation operators for signals on graphs, and explore related properties such as the localization of translated and modulated graph kernels. We then use these operators to define a windowed graph Fourier transform, enabling vertex-frequency analysis. When we apply this transform to a signal with frequency components that vary along a path graph, the resulting spectrogram matches our intuition from classical discrete-time signal processing. Yet, our construction is fully generalized and can be applied to analyze signals on any undirected, connected, weighted graph.