Formula: P = T^-1 W; L_rw = I - T^-1 W
Arguments
- W
Symmetric non-negative weight matrix; every vertex must have
positive degree.
Value
List with Lrw, P, degree, rowsum_P,
n.
References
von Luxburg (2007), A Tutorial on Spectral Clustering, Statistics and
Computing 17(4), 395-416, Section 3, which defines L_rw = I - D^-1 W and notes it
is "closely related to a random walk".
Examples
Rwlap(W = 5L)
#> $Lrw
#> [,1]
#> [1,] 0
#>
#> $P
#> [,1]
#> [1,] 1
#>
#> $degree
#> [1] 5
#>
#> $rowsum_P
#> [1] 1
#>
#> $n
#> [1] 1
#>
#> $method
#> [1] "Random-walk Laplacian I - T^-1 W"
#>
#> attr(,"class")
#> [1] "morie_rich_result" "list"