The cover time of deterministic random walks
T Friedrich, T Sauerwald - International Computing and Combinatorics …, 2010 - Springer
… 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 …
time with the respective bounds of the random walk. … whether random or deterministic walk is …
Deterministic approximation of the cover time
U Feige, Y Rabinovich - Random Structures & Algorithms, 2003 - Wiley Online Library
… 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 …
as part of the input, whereas previous deterministic approximation algorithms for the cover time …
The cover time of random walks on graphs
M Abdullah - arXiv preprint arXiv:1202.5569, 2012 - arxiv.org
… 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 …
case cover time than a simple random walk. We give an upper bound for a random graph of …
The cover time of deterministic random walks for general transition probabilities
T Shiraga - arXiv preprint arXiv:1602.07729, 2016 - arxiv.org
… 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 …
according to general transition probabilities with k tokens, while previous results studied the …
How to explore a fast-changing world (cover time of a simple random walk on evolving graphs)
… 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.) …
guarantees polynomial cover time … are deterministic but oblivious to the actual random walk.) …
The hitting and cover times of random walks on finite graphs using local degree information
S Ikeda, I Kubo, M Yamashita - Theoretical Computer Science, 2009 - Elsevier
… 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 …
two quantities, the hitting and the cover times, of random walks. The hitting time HG(P;u, v) from …
[HTML][HTML] The cover time of deterministic random walks for general transition probabilities
T Shiraga - Theoretical Computer Science, 2020 - Elsevier
… 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 …
random walks according … We give an upper bound of the cover time for any SRT-router …
Deterministic approximation of random walks in small space
… 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 …
on G to within a factor of 1 + ǫ, … polynomial cover time, random walks give a randomized …
Cover time and mixing time of random walks on dynamic graphs
… 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…
cover time of the simple random walk on evolving graphs by studying the maximum hitting time…
Deterministic random walks on finite graphs
S Kijima, K Koga, K Makino - Random Structures & Algorithms, 2015 - Wiley Online Library
… 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:…
during the time interval urn:x-… :rsa20533:rsa20533-math-0078 at time t. Note that urn:x-wiley:…