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
.
Deterministic Approximation of Random Walks in Small Space
2019
International Workshop on Approximation Algorithms for Combinatorial Optimization
We give a deterministic, nearly logarithmic-space algorithm that given an undirected graph G, a positive integer r, and a set S of vertices, approximates the conductance of S in the r-step random walk on G to within a factor of 1 + , where > 0 is an arbitrarily small constant. More generally, our algorithm computes an -spectral approximation to the normalized Laplacian of the r-step walk. Our algorithm combines the derandomized square graph operation [21] , which we recently used for solving
doi:10.4230/lipics.approx-random.2019.42
dblp:conf/approx/MurtaghRSV19
fatcat:qbobogy745ds7b43u23fx3oj4y