Deep Learning, Artificial Intelligence, Self Supervised Learning, Semi Supervised Learning, Graph Laplacian.
value is the sum of each row, which is the number of connections for that node. By D-A, we got Laplacian matrix: Laplacian Matrix L (Example from Here) Sometimes we would like to normalize it such that the all the diagonal values are 1: In this example, the normalized graph Laplacian is: Normalized