Consider a large, probably sparse graph with Markovian random walkers on it. Define the discovery time as the expected time to first reach a vertex by random walk from a uniform start. Are there effective ways to find the discovery times for all or almost all vertices?

  • 1
    $\begingroup$ So you're asking about the cover time (or a variant). $\endgroup$ Oct 20, 2014 at 21:32
  • $\begingroup$ @AnthonyQuas somehow. I want use some random-walker derived score for the vertices of my graph instead of page rank. $\endgroup$
    – Moonwalker
    Oct 21, 2014 at 11:16


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.