A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
High-precision Estimation of Random Walks in Small Space
2020
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
In this paper, we provide a deterministic Õ(log N )-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error (ǫ = 1/poly(N )) where N is the length of the input. Previously, this problem was known to be solvable by a randomized algorithm using space O(log N ) (following Aleliunas et al., FOCS '79) and by a deterministic algorithm using space O(log 3/2 N ) (Saks and Zhou, FOCS '95 and
doi:10.1109/focs46700.2020.00123
fatcat:oydcdvq7cjg4leezgeeljnldce