Spectral computation
Spectral analysis (eigen-decomposition analysis) has been a part of graph theory for over a century.
Eigenvalues and eigenvectors of a network are intimately connected to several important topological features: distance, clusters, and randomness.
In this analysis, we calculate adjacency matrices of two graphs that are created from Route Views and CAIDA datasets .
We use MATLAB to compute the Normalized Laplacian Spectrum of each graph.