Random walks with the minimum degree local rule have $O(n^2)$ cover time.

Roee David Uriel Feige

Published in: CoRR (2016)

Keyphrases

random walk
directed graph
markov chain
transition probabilities
stationary distribution
link prediction
markov random walk
transition probability matrix
search algorithm
association rules
pairwise
text mining
spectral methods