Plotting Normalized Laplacian Spectrum
Due to computational complexity, we reduced matrix size from 65K to 26K where the corresponding nodes aggregate most connections.
Compute all n eigenvalues and sort them in ascending order.
Plot them so that the i-th smallest eigenvalue ?i, 1 ? i ? n, is drawn at (x, y) with x = (i - 1)/(n - 1) and y = ?i.