The Continuous Graph FFT
Robert Carlson (University of Colorado at Colorado Springs)
TL;DR
This paper extends the discrete Fourier transform and FFT algorithm from traditional circular domains to continuous graphs with equal edge lengths, broadening their applicability to more complex graph structures.
Contribution
It introduces a novel extension of Fourier analysis and FFT to continuous graphs, enabling new spectral analysis techniques for such structures.
Findings
Extended Fourier transform applicable to continuous graphs
FFT algorithm adapted for continuous graph structures
Potential applications in spectral graph theory
Abstract
The discrete Fourier transform and the FFT algorithm are extended from the circle to continuous graphs with equal edge lengths.
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
TopicsSpectral Theory in Mathematical Physics · Matrix Theory and Algorithms · Graph theory and applications