Expand description
Adjacency spectral embedding (ALGO-EM-002).
Computes an no-dimensional Euclidean representation of the graph
based on the spectral decomposition of its adjacency matrix.
For undirected graphs, decomposes A = U D U^T (eigendecomposition)
and returns X = U^no (the first no eigenvectors). If scaled,
multiplies each column by sqrt(|λ_i|).
Counterpart of igraph_adjacency_spectral_embedding() from
references/igraph/src/misc/embedding.c:872.
Structs§
- Adjacency
Spectral Embedding Result - Result of adjacency spectral embedding.
Enums§
- Spectral
Which - Which eigenvalues to select for spectral embedding.
Functions§
- adjacency_
spectral_ embedding - Compute the adjacency spectral embedding of an undirected graph.