Given a single graph, and two different "biased" random walk models on the same undirected graph, how does on theoretically compare the two models? What are the metrics one should theoretically study to show one method's superiority over the other? For e.g., is "mixing time" a good performance metric to compare on?

  • $\begingroup$ When is a random walk better than another? What are you trying to accomplish with it? $\endgroup$ – parsiad Mar 9 at 6:58
  • $\begingroup$ @parsiad As in which walk is faster or which walk covers more of the nodes from a particular subgraph? $\endgroup$ – cbro Mar 9 at 11:38

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.