Login / Signup

The hitting and cover times of random walks on finite graphs using local degree information.

Satoshi IkedaIzumi KuboMasafumi Yamashita
Published in: Theor. Comput. Sci. (2009)
Keyphrases
  • random walk
  • directed graph
  • machine learning
  • information extraction
  • transition probabilities