… deterministic walk, but it is instructive to compare our results for the vertex and edge cover
time with the respective bounds of the random walk. … whether random or deterministic walk is …

… approximates the cover time for arbitrary … the random walk may be arbitrary and is given
as part of the input, whereas previous deterministic approximation algorithms for the cover time …

… Finally, we explore random walks with weighted random edge choices. We present a … worst
case cover time than a simple random walk. We give an upper bound for a random graph of …

… Our results This paper is concerned with the cover time of the deterministic random walk
according to general transition probabilities with k tokens, while previous results studied the …

… We relate this result to the cover time of static directed graphs… , the lazy random walk, that
guarantees polynomial cover time … are deterministic but oblivious to the actual random walk.) …

… are adopted at the expense of performance, instead of using more efficient deterministic …
two quantities, the hitting and the cover times, of random walks. The hitting time HG(P;u, v) from …

… cover time of random walks and deterministic random walks. … with the cover time of deterministic
random walks according … We give an upper bound of the cover time for any SRT-router …

… We give a deterministic, nearly logarithmic-space algorithm … of S in the r-step random walk
on G to within a factor of 1 + ǫ, … polynomial cover time, random walks give a randomized …

… say that our examples are deterministic, but oblivious to the actual random walk.) To state …
cover time of the simple random walk on evolving graphs by studying the maximum hitting time…

… We consider a partially deterministic random walk as follows; … from random walks of tokens
during the time interval urn:x-… :rsa20533:rsa20533-math-0078 at time t. Note that urn:x-wiley:…