Given an undirected graph $G$ with adjacency matrix $A$ and Graph Laplacian $L=D-A$, where $D$ is the degree matrix.
I wonder whether the eigenspaces of $L$, let's call them $(V_i)_{i=1}^n$, contain information about the clusters on the graph.
Given an undirected graph $G$ with adjacency matrix $A$ and Graph Laplacian $L=D-A$, where $D$ is the degree matrix.
I wonder whether the eigenspaces of $L$, let's call them $(V_i)_{i=1}^n$, contain information about the clusters on the graph.
Copyright © 2021 JogjaFile Inc.