• Corpus ID: 85542651

Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space

  title={Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space},
  author={Mikhail Kapralov and Navid Nouri and Aaron Sidford and Jakab Tardos},
In this paper we consider the problem of computing spectral approximations to graphs in the single pass dynamic streaming model. We provide a linear sketching based solution that given a stream of edge insertions and deletions to a $n$-node undirected graph, uses $\tilde O(n)$ space, processes each update in $\tilde O(1)$ time, and with high probability recovers a spectral sparsifier in $\tilde O(n)$ time. Prior to our work, state of the art results either used near optimal $\tilde O(n)$ space… 

Figures from this paper

Faster Spectral Sparsification in Dynamic Streams

A novel method for `bucketing' vertices of the input graph into clusters that allows fast recovery of edges of high effective resistance: the buckets are formed by performing ball-carving on the inputgraph using (an approximation to) its effective resistance metric.

Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model

This paper introduces several new graph sketching techniques for approximating the shortest path metric of the input graph, and gives new spanner construction algorithms for any number of passes, simultaneously improving upon all prior work on this problem.

Online Spectral Approximation in Random Order Streams

An online algorithm is proposed that avoids an additive error with the same time and space complexities as the algorithm of Cohen et al., and provides a better upper bound on the approximation size when a given matrix has small rank.

On Constructing Spanners from Random Gaussian Projections

A strong lower bound is proved for a large family of graph sketching algorithms that encompasses prior work on spanners and many (but importantly not also all) related cut-based problems mentioned above.

Breaking the n-Pass Barrier: A Streaming Algorithm for Maximum Weight Bipartite Matching

This is the first work that implements the SDD solver and IPM in the streaming model in $\widetilde{O}(n)$ spaces for graph matrix and combines a number of techniques from different fields such as the interior point method, symmetric diagonally dominant system solving, the isolation lemma, and LP duality.

Sparsification of Balanced Directed Graphs

The upper bounds work for general weighted graphs, while the lower bounds even hold for unweighted graphs with no parallel edges.

Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching

To the best of the knowledge, this is the first LP solver in streaming that has no space dependence on m, and a space-efficient interior point method that optimizes solely on the dual program is developed.

Solving tall dense linear programs in nearly linear time

Interestingly, the running time of this robust, primal-dual O(√d)-iteration interior point method is near optimal for solving dense linear programs among algorithms that do not use fast matrix multiplication.

Sparsification of Directed Graphs via Cut Balance

An interesting application of digraph sparsification via cut balance is shown by using it to give a very short proof of a celebrated maximum flow result of Karger and Levine (STOC 2002).

Graph Spanners in the Message-Passing Model

This work presents the first tradeoffs for total communication versus the quality of the spanners computed, for two or more sites, as well as for additive and multiplicative notions of distortion.



Faster Spectral Sparsification in Dynamic Streams

A novel method for `bucketing' vertices of the input graph into clusters that allows fast recovery of edges of high effective resistance: the buckets are formed by performing ball-carving on the inputgraph using (an approximation to) its effective resistance metric.

Single Pass Spectral Sparsification in Dynamic Streams

This work presents the first single pass algorithm for computing spectral sparsifiers of graphs in the dynamic semi-streaming model and shows that, using a coarse sparsifier of G and a linear sketch of G's incidence matrix, it is possible to sample edges by effective resistance, obtaining a spectral sparifier of arbitrary precision.

Spanners and sparsifiers in dynamic streams

This paper gives the first sketch-based algorithm for constructing multiplicative graph spanners that provides an additive approximation to the shortest path metric using a single pass over the data stream, achieving an essentially best possible space/approximation tradeoff.

On Fully Dynamic Graph Sparsifiers

We initiate the study of fast dynamic algorithms for graph sparsification problems and obtain fully dynamic algorithms, allowing both edge insertions and edge deletions, that take polylogarithmic

Spectral Sparsification in the Semi-streaming Setting

An algorithm for constructing a spectral sparsifier of G with O(nlogn/ϵ2) edges, taking $\tilde{O}(m)$ time and requiring only one pass over G, which has the property that it maintains at all times a valid sparsifiers for the subgraph of G that the authors have received.

Spectral Subspace Sparsification

  • Huan LiAaron Schild
  • Computer Science, Mathematics
    2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
A new approach to spectral sparsification that approximates the quadratic form of the pseudoinverse of a graph Laplacian restricted to a subspace and yields sparsifiers that are reweighted minors of the input graph, giving a near-optimal answer to a variant of the Steiner point removal problem.

Spectral Sparsification in Dynamic Graph Streams

This work presents a new bound relating edge connectivity in a simple, unweighted graph with effective resistance in the corresponding electrical network, and implies that by simply increasing the sampling probability by a O(n 2/3) factor in the combinatorial sparsifier construction, this work also preserves the spectral properties of the graph.

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions

We develop a framework for graph sparsification based on a new tool, short cycle decomposition for graphs – a decomposition of a graph into a collection of short cycles, plus a small number of extra

Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates

This paper explains how matrix MWU naturally arises as an instance of the Follow-the-Regularized-Leader framework and generalizes this approach to yield a larger class of updates, which allows the construction of linear-sized spectral sparsifiers, and gives novel insights on the motivation behind Batson, Spielman and Srivastava.

A Framework for Analyzing Resparsification Algorithms

This work presents a framework for analyzing algorithms that perform repeated sparsifications that only incur error corresponding to a single sparsification step, leading to better results for many of these reseparsification based algorithms.