On the eigenvalues of weighted directed graphs

DOI10.1007/S11785-016-0615-7MaRDI QIDQ6287531arXivFDO

Authors Marwa Balti

Publication date 6 June 2017

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11785-016-0615-7

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Estimates of eigenvalues in context of PDEs (35P15) Spectrum, resolvent (47A10) Eigenvalue problems for linear operators (47A75) Variational methods for eigenvalues of operators (49R05)

arXiv classification

math.SP

Abstract: This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as the sum of two non self-adjoint Laplacians. We investigate how the perturbation of the graph can affect the eigenvalues. Our approach is to take well known techniques from finite dimensional matrix analysis and show how they can be generalized for graph Laplacians.

This page was built for publication: On the eigenvalues of weighted directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287531)