Tight bounds for the cover time of multiple random walks.

Robert Elsässer Thomas Sauerwald

Published in: Theor. Comput. Sci. (2011)

Keyphrases

random walk
tight bounds
upper bound
markov chain
directed graph
transition probabilities
clustering algorithm
reinforcement learning
text mining
web graph
spectral methods