Efficient Computation of Mean Truncated Hitting Times on Very Large Graphs

Joel Lang, James Henderson

Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering,…