Login / Signup

Tight Bounds for the Cover Time of Multiple Random Walks.

Robert ElsässerThomas Sauerwald
Published in: ICALP (1) (2009)
Keyphrases
  • random walk
  • tight bounds
  • upper bound
  • markov chain
  • directed graph
  • spectral methods
  • web graph
  • transition probability matrix
  • learning algorithm
  • transition probabilities