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?
2

1$\begingroup$ So you're asking about the cover time (or a variant). $\endgroup$– Anthony QuasOct 20, 2014 at 21:32

$\begingroup$ @AnthonyQuas somehow. I want use some randomwalker derived score for the vertices of my graph instead of page rank. $\endgroup$– MoonwalkerOct 21, 2014 at 11:16
Add a comment
