Table 1. Laplacian-based Network Embedding (LaBNE).

Note that to embed a network G to , the truncated spectral decomposition of L is used. This gives the closest approximation to the eigen-decomposition by a matrix λ_k+1 of rank k + 1 and ensures that the computational complexity of LaBNE is O(N²).