A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Network representation matrices and their eigenproperties: a comparative study
Typically, network structures are represented by one of three different representation matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. We review their spectral (eigenvalue) and eigenvector properties and recall several relations to graph theoretic quantities. We compare the representation spectra pairwise by applying an affine transformation to one of them, which enables comparison whilst preserving certain key properties such as normaliseddoi:10.25560/82477 fatcat:x4fu5ifeazbxpf4gnnhzsbyvje