Harmonic Analysis on Directed Networks: A Biorthogonal Laplacian Framework for Non-Normal Graphs

Abstract

Classical spectral graph theory relies on the symmetry of the adjacency and Laplacian operators, which guarantees orthogonal eigenbases and energy-preserving Fourier transforms. However, real-world networks are intrinsically directed and asymmetric, resulting in non-normal operators where standard orthogonality assumptions fail. In this paper, we develop a rigorous harmonic analysis framework for directed graphs centered on the Combinatorial Directed Laplacian (L = Dout - A). We construct a Biorthogonal Graph Fourier Transform (BGFT) using dual left and right eigenbases, and introduce a directed variational semi-norm based on the operator norm \|Lx\|2 rather than the quadratic form. We derive exact Parseval-type bounds that quantify the energy distortion induced by the non-normality of the graph, explicitly linking signal reconstruction stability to the condition number of the eigenvector matrix, (V). Finally, we present experimental validation comparing normal directed cycles against non-normal perturbed topologies, demonstrating that while the BGFT provides exact reconstruction in ideal regimes, the geometric departure from normality acts as the fundamental limit on filter stability in directed networks.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…