Eigenvectors, Eigenvalue, Data Science, Machine Learning, Principal Component.
get some intuition of how the Laplacian elicits the local structure, where the values of two nodes should be close to each other if they are actually near each other in the graph, not just if they are similarly globally central. We can therefore find optimal graph cuts that result in locally dense,