Approximating the Spectrum of a Graph

David Cohen-Steiner, Weihao Kong, Christian Sohler +1

The spectrum of a network or graph $G=(V,E)$ with adjacency matrix $A$, consists of the eigenvalues of the normalized Laplacian $L=I-D^{-1/2}A{D}^{-1/2}$. This set of eigenvalue…