Spectral Subspace Sparsification

10/07/2018
by   Huan Li, et al.
0

We introduce a new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace. We show that sparsifiers with a near-linear number of edges in the dimension of the subspace exist. Our setting generalizes that of Schur complement sparsifiers. Our approach produces sparsifiers by sampling a uniformly random spanning tree of the input graph and using that tree to guide an edge elimination procedure that contracts, deletes, and reweights edges. In the context of Schur complement sparsifiers, our approach has two benefits over prior work. First, it produces a sparsifier in almost-linear time with no runtime dependence on the desired error. We directly exploit this to compute approximate effective resistances for a small set of vertex pairs in faster time than prior work (Durfee-Kyng-Peebles-Rao-Sachdeva '17). Secondly, it yields sparsifiers that are reweighted minors of the input graph. As a result, we give a near-optimal answer to a variant of the Steiner point removal problem. A key ingredient of our algorithm is a subroutine of independent interest: a near-linear time algorithm that, given a chosen set of vertices, builds a data structure from which we can query a multiplicative approximation to the decrease in the effective resistance between two vertices after identifying all vertices in the chosen set to a single vertex with inverse polynomial additional additive error in near-constant time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/26/2017

Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees

Given a graph G = (V, E), n=|V|, m=|E|, we wish to compute a spanning tr...
research
03/28/2019

Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space

In this paper we consider the problem of computing spectral approximatio...
research
11/17/2017

An almost-linear time algorithm for uniform random spanning tree generation

We give an m^1+o(1)β^o(1)-time algorithm for generating a uniformly rand...
research
07/08/2020

Linear-Time Algorithms for Computing Twinless Strong Articulation Points and Related Problems

A directed graph G=(V,E) is twinless strongly connected if it contains a...
research
03/28/2019

Faster Spectral Sparsification in Dynamic Streams

Graph sketching has emerged as a powerful technique for processing massi...
research
08/17/2023

Computing complexity measures of degenerate graphs

We show that the VC-dimension of a graph can be computed in time n^log d...
research
11/02/2022

A New Approach to Estimating Effective Resistances and Counting Spanning Trees in Expander Graphs

We demonstrate that for expander graphs, for all ϵ > 0, there exists a d...

Please sign up or login with your details

Forgot password? Click here to reset