Login / Signup

A Spanning Tree Method for Bounding Hitting Times of Random Walks on Graphs.

Randy CogillCheng Peng
Published in: SIAM J. Discret. Math. (2010)
Keyphrases
  • random walk
  • spanning tree
  • minimum spanning tree
  • dynamic programming
  • markov chain
  • minimum spanning trees
  • pairwise
  • directed graph
  • reinforcement learning
  • objective function
  • segmentation method
  • spectral methods