I’m curious whether the development team would be interested in the addition of graph embedding functionality, specifically adding Adjacency/Laplacian spectral embedding to scipy.sparse.csgraph (or anywhere else it would make sense to have it). Both methods are useful in a variety of graph applications, such as clustering nodes with similar connective structure; in essence, they both amount to an SVD.

Our current implementations in GraSPy, (available at ASE and LSE) input a graph represented as a dense or sparse matrix, and return the appropriate embedding. Please let me know if you'd like to add these functions to scipy.

Best,

Ali Saad-Eldin