Groups
Category
Spectral convolution on graphs generalizes the classical notion of convolution using the graphโs Laplacian eigenvectors as โFourierโ basis functions.
Spectral graph theory studies graphs by looking at eigenvalues and eigenvectors of matrices like the adjacency matrix A and Laplacians L and L_norm.