Nearly Linear Time Algorithm for Mean Hitting Times of Random Walks on a Graph.
Zuobai ZhangWanyue XuZhongzhi ZhangPublished in: WSDM (2020)
Keyphrases
- random walk
- learning algorithm
- hyper graph
- k means
- worst case
- markov chain
- random walker
- dynamic programming
- directed graph
- multi db
- np hard
- flow graph
- graph structure
- transition probability matrix
- minimum spanning tree
- undirected graph
- reinforcement learning
- data clustering
- spanning tree
- np complete
- edge weights
- dimensionality reduction
- pagerank algorithm
- state space
- image segmentation
- clustering algorithm
- social networks