How to Design a Linear Cover Time Random Walk on a Finite Graph.

Yoshiaki Nonaka Hirotaka Ono Kunihiko Sadakane Masafumi Yamashita

Published in: SAGA (2009)

Keyphrases

random walk
directed graph
markov chain
link prediction
flow graph
spectral methods
transition probability matrix
transition probabilities
graph laplacian
multi db
markov random walk
np hard
information extraction
proximity measures
average degree
random walker