Deterministic Approximation of Random Walks in Small Space

03/15/2019
by   Jack Murtagh, et al.
0

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 (Rozenman and Vadhan, 2005), which we recently used for solving Laplacian systems in nearly logarithmic space (Murtagh, Reingold, Sidford, and Vadhan, 2017), with ideas from (Cheng, Cheng, Liu, Peng, and Teng, 2015), which gave an algorithm that is time-efficient (while ours is space-efficient) and randomized (while ours is deterministic) for the case of even r (while ours works for all r). Along the way, we provide some new results that generalize technical machinery and yield improvements over previous work. First, we obtain a nearly linear-time randomized algorithm for computing a spectral approximation to the normalized Laplacian for odd r. Second, we define and analyze a generalization of the derandomized square for irregular graphs and for sparsifying the product of two distinct graphs. As part of this generalization, we also give a strongly explicit construction of expander graphs of every size.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2017

Derandomization Beyond Connectivity: Undirected Laplacian Systems in Nearly Logarithmic Space

We give a deterministic Õ( n)-space algorithm for approximately solving ...
research
02/12/2015

Spectral Sparsification of Random-Walk Matrix Polynomials

We consider a fundamental algorithmic question in spectral graph theory:...
research
12/10/2019

High-precision Estimation of Random Walks in Small Space

In this paper, we provide a deterministic Õ(log N)-space algorithm for e...
research
02/26/2020

Spectral Sparsification via Bounded-Independence Sampling

We give a deterministic, nearly logarithmic-space algorithm for mild spe...
research
01/31/2023

Singular Value Approximation and Reducing Directed to Undirected Graph Sparsification

In this paper, we introduce a new, spectral notion of approximation betw...
research
05/30/2021

ℓ_2-norm Flow Diffusion in Near-Linear Time

Diffusion is a fundamental graph procedure and has been a basic building...
research
11/03/2021

Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size

Consider the following computational problem: given a regular digraph G=...

Please sign up or login with your details

Forgot password? Click here to reset