Applications of SVD for Graph Problems
Network Centrality
Counting the number of triangles in a graph
Slide 35 in http://www.cs.cmu.edu/~christos/TALKS/15-04-USC/faloutsos_USC_2015.pdf
Application is in finding anomalous nodes
Detecting communities in graphs
- Eigenspokes: Surprising patterns and scalable community chipping in large graphs.