Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random Walk with Restart (RWR) provides a good proximity score between two nodes in a graph, and it has been successfully used in many applications such as automatic image captioning, recommender systems, and link prediction. The goal of this paper is to find nodes that have top-k highest proximities for a given node. Previous approaches to this problem find nodes efficiently at the expense of exactness.