Angular Graph Fractional Fourier Transform: Theory and Application
Feiyue Zhao, Yangfan He, and Zhichao Zhang

TL;DR
This paper introduces the angular graph fractional Fourier transform (AGFRFT), a unified framework combining fractional and angular spectral analysis in graph signal processing, with theoretical guarantees and superior practical performance.
Contribution
It proposes a novel AGFRFT that resolves degeneracy issues and unifies fractional and angular spectral analysis with rigorous theoretical properties.
Findings
AGFRFT outperforms GFRFT and AGFT in spectral concentration.
Demonstrates improved reconstruction quality in denoising tasks.
Supports learnable joint parameterization for adaptive spectral processing.
Abstract
Graph spectral representations are fundamental in graph signal processing, offering a rigorous framework for analyzing and processing graph-structured data. The graph fractional Fourier transform (GFRFT) extends the classical graph Fourier transform (GFT) with a fractional-order parameter, enabling flexible spectral analysis while preserving mathematical consistency. The angular graph Fourier transform (AGFT) introduces angular control via GFT eigenvector rotation; however, existing constructions fail to degenerate to the GFT at zero angle, which is a critical flaw that undermines theoretical consistency and interpretability. To resolve these complementary limitations - GFRFT's lack of angular regulation and AGFT's defective degeneracy - this study proposes an angular GFRFT (AGFRFT), a unified framework that integrates fractional-order and angular spectral analyses with theoretical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph theory and applications · Graph Theory and Algorithms
