Local Access to Random Walks

For a graph G on n vertices, naively sampling the position of a random walk of at time t requires work Ω(t). We desire local access algorithms supporting position(G, s, t) queries, which return the position of a random walk from some start vertex s at time t, where the joint distribution of returned positions is 1/ poly(n) close to the uniform distribution over such walks in l1 distance. We first give an algorithm for local access to walks on undirected regular graphs with Õ( 1 1−λ √ n) runtime per query, where λ is the second-largest eigenvalue in absolute value. Since random d-regular graphs are expanders with high probability, this gives an Õ( √ n) algorithm for G(n, d), which improves on the naive method for small numbers of queries. We then prove that no that algorithm with subconstant error given probe access to random d-regular graphs can have runtime better than Ω( √ n/ log(n)) per query in expectation, obtaining a nearly matching lower bound. We further show an Ω(n1/4) runtime per query lower bound even with an oblivious adversary (i.e. when the query sequence is fixed in advance). We then show that for families of graphs with additional group theoretic structure, dramatically better results can be achieved. We give local access to walks on small-degree abelian Cayley graphs, including cycles and hypercubes, with runtime polylog(n) per query. This also allows for efficient local access to walks on polylog degree expanders. We extend our results to graphs constructed using the tensor product (giving local access to walks on degree n graphs for any ε ∈ (0, 1]) and Cartesian product. 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms