Random Walk Clustering on Weighted Graphs
Generic helper for extracting adjacency matrix from rwclust object.
Apply similarity function to rows of a matrix
Apply similarity function over edges of graph
Compute transition matrix
Construct sparse matrix from weighted edgelist
rwclust class constructor
Generic plotting for rwclust object
Execute main algorithm loop
Sharpen the edge weights of a weighted graph.
Update edge weights
Implements the random walk clustering algorithm for weighted graphs as found in Harel and Koren (2001) <https://link.springer.com/chapter/10.1007/3-540-45294-X_3>.