Description Usage Arguments Details Value
Spectral Decomposition of Affiliation Matrix After Symmetric Normalization
1 | .adj_eigen_norm(x, k, check_dang, check_sym, set_diag_zero)
|
x |
sparse affiliation matrix |
k |
number of (largest) eigenpairs to extract |
check_dang |
check whether there are dangling nodes |
check_sym |
check whether |
set_diag_zero |
if |
the normalized adjacency matrix is D^{-1/2}AD^{-1/2}, where D^{-1/2} is the square-root of the diagonal matrix containing the degrees of A.
returns the k
largest eigenvalue-eigen vector pairs of the normalized affiliation matrix
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.