Asymmetry in Spectral Graph Theory: Harmonic Analysis on Directed Networks via Biorthogonal Bases

Main Article Content

Chandrasekhar Gokavarapu

Abstract

The operator-theoretic dichotomy underlying diffusion on directed networks is symmetry versus non-self-adjointness of the Markov transition operator. In the reversible (detailedbalance) regime, a directed random walk P is self-adjoint in a stationary π-weighted inner product and admits orthogonal spectral coordinates; outside reversibility, P is genuinely non-self-adjoint (often non-normal), and stability is governed by biorthogonal geometry and eigenvector conditioning. In this paper, we develop an original harmonic-analysis framework for directed graphs anchored on the random-walk transition matrix P = Dout−1A and the random-walk Laplacian Lrw = I−P. Using biorthogonal left/right eigenvectors, we define a Biorthogonal Graph Fourier Transform (BGFT) adapted to directed diffusion, propose a diffusion-consistent frequency ordering based on decay rates ℜ(1 −λ), and derive operator norm stability bounds for iterated diffusion and for BGFT spectral filters. We prove sampling and reconstruction theorems for P-bandlimited (equivalently Lrw -bandlimited) signals and quantify noise amplification through the conditioning of the biorthogonal eigenbasis. A simulation protocol on directed cycles and perturbed non-normal digraphs demonstrates that asymmetry alone does not dictate instability, whereas non-normality and eigenvector illconditioning drive reconstruction sensitivity, making BGFT the correct analytical language for directed diffusion processes.

Downloads

Download data is not yet available.

Article Details

Gokavarapu, C. (2026). Asymmetry in Spectral Graph Theory: Harmonic Analysis on Directed Networks via Biorthogonal Bases. Annals of Mathematics and Physics, 001–006. https://doi.org/10.17352/amp.000174
Research Articles

Copyright (c) 2026 Gokavarapu C.

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Chung F. Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics. 2005;9(1):1–19. Available from: https://link.springer.com/article/10.1007/s00026-005-0237-z

Shuman DI, Narang SK, Frossard P, Ortega A, Vandergheynst P. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine. 2013;30(3):83–98. Available from: https://ieeexplore.ieee.org/document/6494675

Sandryhaila A, Moura JMF. Discrete signal processing on graphs: Frequency analysis. IEEE Transactions on Signal Processing. 2014;62(12):3042–3054. Available from: https://ieeexplore.ieee.org/document/6808520

Sardellitti S, Barbarossa S, Di Lorenzo P. On the graph Fourier transform for directed graphs. IEEE Journal of Selected Topics in Signal Processing. 2017;11(6):796–811. Available from: https://ieeexplore.ieee.org/document/7979496

Marques AG, Segarra S, Mateos G. Signal processing on directed graphs. arXiv [Internet]. 2020. Available from: https://arxiv.org/abs/2008.00586

Levin DA, Peres Y. Markov chains and mixing times. 2nd ed. Providence (RI): American Mathematical Society; 2017. Available from: https://pages.uoregon.edu/dlevin/MARKOV/markovmixing.pdf

Trefethen LN, Embree M. Spectra and pseudospectra: The behavior of nonnormal matrices and operators. Princeton (NJ): Princeton University Press; 2005. Available from: https://www.karlin.mff.cuni.cz/~kaplicky/pages/pages/2021l/book.pdf

Higham NJ. What is a (non)normal matrix? [Internet]. 2020. Available from: https://nhigham.com/2020/11/24/what-is-a-nonnormal-matrix/

Norris JR. Markov chains. Cambridge: Cambridge University Press; 1997. Available from: https://cape.fcfm.buap.mx/jdzf/cursos/procesos/libros/norris.pdf

Kelly FP. Reversibility and stochastic networks. New York: Wiley; 1979. Available from: https://www.amazon.in/Reversibility-Stochastic-Networks-Cambridge-Mathematical/dp/1107401151

Seneta E. Non-negative matrices and Markov chains. 2nd ed. Berlin: Springer; 1981. Available from: https://link.springer.com/book/10.1007/0-387-32792-4

Henrici P. Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices. Numerische Mathematik. 1962;4:24–40. Available from: https://link.springer.com/article/10.1007/BF01386294

Lee SL. A practical upper bound for departure from normality. SIAM Journal on Matrix Analysis and Applications. 1995;16:462–468. Available from: https://doi.org/10.1137/S0895479893255184

Elsner L, Paardekooper MHC. On measures of nonnormality of matrices. Linear Algebra and its Applications. 1987;92:107–124. Available from: https://doi.org/10.1016/0024-3795(87)90253-9

Toh K-C, Trefethen LN. The Kreiss matrix theorem on a general complex domain. SIAM Journal on Matrix Analysis and Applications. 1999;20. Available from: https://doi.org/10.1137/S0895479897324020

Ortega A, Frossard P, Kovačević J, Moura JMF, Vandergheynst P. Graph signal processing: Overview, challenges, and applications. Proceedings of the IEEE. 2018;106(5):808–828. Available from: https://ieeexplore.ieee.org/document/8347162

Anis A, Gadde A, Ortega A. Efficient sampling set selection for bandlimited graph signals using graph spectral proxies. IEEE Transactions on Signal Processing. 2016. Available from: https://ieeexplore.ieee.org/document/7439829

Pesenson I. Sampling in Paley–Wiener spaces on combinatorial graphs. Transactions of the American Mathematical Society. 2008;360:5603–5627. Available from: https://arxiv.org/html/2512.21770v1

Marques AG, Segarra S, Mateos G. Signal processing on directed graphs: The role of edge directionality when processing and learning from network data. IEEE Signal Processing Magazine. 2020;37(6):99–116. Available from: https://ieeexplore.ieee.org/document/9244648c