A Fast Method to Calculate Hitting Time Distribution for a Random Walk on Connected Undirected Graph.

Published in: CoRR (2019)

Keyphrases

random walk
transition probability matrix
pairwise
markov chain
directed graph
similarity measure
objective function
probability distribution
proximity measures
social networks
dynamic programming
link prediction
nodes of a graph