Speeding up cover time of sparse graphs using local knowledge

Citations of this article
Mendeley users who have this article in their library.
Get full text


We analyse the cover time of a random walk on a random graph of a given degree sequence. Weights are assigned to the edges of the graph using a certain type of scheme that uses only local degree knowledge. This biases the transitions of the walk towards lower degree vertices. We demonstrate that, with high probability, the cover time is at most (Formula presented), where d is the minimum degree. This is in contrast to the precise cover time of (Formula presented) (with high probability) given in [1] for a simple (i.e., unbiased) random walk on the same graph model. Here θ is the average degree and since the ratio θ/d can be arbitrarily large, or go to infinity with n, we see that the scheme can give an unbounded speed up for sparse graphs.




Abdullah, M. A., Cooper, C., & Draief, M. (2016). Speeding up cover time of sparse graphs using local knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9538, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-319-29516-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free