Asymmetry in Spectral Graph Theory: Harmonic Analysis on Directed Networks via Biorthogonal Bases (Adjacency-Operator Formulation)
Chandrasekhar Gokavarapu (Department of Mathematics, Government College (A), Rajahmundry, A.P., India)

TL;DR
This paper introduces a harmonic analysis framework for directed networks using biorthogonal bases, addressing the challenges posed by asymmetry and non-normality in spectral graph theory.
Contribution
It develops a Biorthogonal Graph Fourier Transform for directed graphs, providing new tools for spectral analysis in non-Hermitian settings.
Findings
BGFT enables stable reconstruction of directed graph signals.
Asymmetry affects spectral stability and filtering performance.
Simulation shows BGFT outperforms traditional methods on directed networks.
Abstract
Classical spectral graph theory and graph signal processing rely on a symmetry principle: undirected graphs induce symmetric (self-adjoint) adjacency/Laplacian operators, yielding orthogonal eigenbases and energy-preserving Fourier expansions. Real-world networks are typically directed and hence asymmetric, producing non-self-adjoint and frequently non-normal operators for which orthogonality fails and spectral coordinates can be ill-conditioned. In this paper we develop an original harmonic-analysis framework for directed networks centered on the \emph{adjacency} operator. We propose a \emph{Biorthogonal Graph Fourier Transform} (BGFT) built from left/right eigenvectors, formulate directed ``frequency'' and filtering in the non-Hermitian setting, and quantify how asymmetry and non-normality affect stability via condition numbers and a departure-from-normality functional. We prove exact…
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
