A Markov chain model for the search time for max degree nodes in a graph using a biased random walk.

Jonathan Stokes, Steven Weber

Browse the full CISS paper archive.