Spectral Embedding of Adjacency Matrices

Spectral decomposition of the adjacency matrices of graphs.

embed_adjacency_matrix(graph, no, weights = NULL, which = c("lm", "la",
  "sa"), scaled = TRUE, cvec = graph.strength(graph, weights =
  weights)/(vcount(graph) - 1), options = igraph.arpack.default)
The input graph, directed or undirected.
An integer scalar. This value is the embedding dimension of the spectral embedding. Should be smaller than the number of vertices. The largest no-dimensional non-zero singular values are used for the spectral embedding.
Optional positive weight vector for calculating weighted closeness. If the graph has a weight edge attribute, then this is used by default.
Which eigenvalues (or singular values, for directed graphs) to use. lm means the ones with the largest magnitude, la is the ones (algebraic) largest, and sa is the (algebraic) smallest eigenvalues. The de
Logical scalar, if FALSE, then $U$ and $V$ are returned instead of $X$ and $Y$.
A numeric vector, its length is the number vertices in the graph. This vector is added to the diagonal of the adjacency matrix.
A named list containing the parameters for the SVD computation algorithm in ARPACK. By default, the list of values is assigned the values given by igraph.arpack.default.

This function computes a no-dimensional Euclidean representation of the graph based on its adjacency matrix, $A$. This representation is computed via the singular value decomposition of the adjacency matrix, $A=UDV^T$.In the case, where the graph is a random dot product graph generated using latent position vectors in $R^{no}$ for each vertex, the embedding will provide an estimate of these latent vectors.

For undirected graphs the latent positions are calculated as $X=U^{no}D^{1/2}$, where $U^{no}$ equals to the first no columns of $U$, and $D^{1/2}$ is a diagonal matrix containing the top no singular values on the diagonal.

For directed graphs the embedding is defined as the pair $X=U^{no}D^{1/2}$ and $Y=V^{no}D^{1/2}$. (For undirected graphs $U=V$, so it is enough to keep one of them.)


  • A list containing with entries:
  • XEstimated latent positions, an n times no matrix, n is the number of vertices.
  • YNULL for undirected graphs, the second half of the latent positions for directed graphs, an n times no matrix, n is the number of vertices.
  • DThe eigenvalues (for undirected graphs) or the singular values (for directed graphs) calculated by the algorithm.
  • optionsA named list, information about the underlying ARPACK computation. See arpack for the details.


Sussman, D.L., Tang, M., Fishkind, D.E., Priebe, C.E. A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs, Journal of the American Statistical Association, Vol. 107(499), 2012

See Also


  • embed_adjacency_matrix
## A small graph
lpvs <- matrix(rnorm(200), 20, 10)
lpvs <- apply(lpvs, 2, function(x) { return (abs(x)/sqrt(sum(x^2))) })
RDP <- sample_dot_product(lpvs)
embed <- embed_adjacency_matrix(RDP, 5)
Documentation reproduced from package igraph, version 1.0.0, License: GPL (>= 2)

Community examples

Looks like there are no examples yet.