SALSA (Lempel and Moran 2000) ranks authorities by a random walk that alternates between following an edge backward and forward. The authority score of a node is its entry in the stationary distribution of the chain $$\tilde{A} = W_c^{T} W_r,$$ where \(W_r\) and \(W_c\) are the row-normalized and column-normalized adjacency matrices.
Arguments
- x
Network input accepted by
centrality.- ...
Further arguments to
centrality.
Details
The measure needs a directed network. On undirected input every score is
NA with a cograph_undefined_measure warning. Edge weights are
ignored. The scores are scaled so that the largest is 1, and a node
without incoming edges scores 0.
References
Lempel, R., & Moran, S. (2000). The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks, 33(1-6), 387-401. doi:10.1016/S1389-1286(00)00034-7 .
