dot-adj_eigen_left_norm: Spectral Decomposition of (Left) Normalized Adjacency Matrix
In baruuum/btoolbox: random toolbox

Spectral Decomposition of (Left) Normalized Adjacency Matrix

1	.adj_eigen_left_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 `x` is symmetric
`set_diag_zero`	if `true`, sets the diagonals of `x` to zero

the (left) normalized adjacency matrix is defined as A' = D^{-1}A, where D is the diagonal matrix containing the degrees of A.

returns the k (largest) eigenvalue-eigen vector pairs of the (left) normalized adjacency matrix

baruuum/btoolbox documentation built on Aug. 17, 2020, 1:29 a.m.

baruuum/btoolbox index

README.md

Note that we can't provide technical support on individual packages. You should contact the package authors for that.

Description