Optimal Lower Bounds for Sketching Graph Cuts

12/29/2017
by   Charles Carlson, et al.
0

We study the space complexity of sketching cuts and Laplacian quadratic forms of graphs. We show that any data structure which approximately stores the sizes of all cuts in an undirected graph on n vertices up to a 1+ϵ error must use Ω(n n/ϵ^2) bits of space in the worst case, improving the Ω(n/ϵ^2) bound of Andoni et al. and matching the best known upper bound achieved by spectral sparsifiers. Our proof is based on a rigidity phenomenon for cut (and spectral) approximation which may be of independent interest: any two d-regular graphs which approximate each other's cuts significantly better than a random graph approximates the complete graph must overlap in a constant fraction of their edges.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

Sparsification of Balanced Directed Graphs

Sparsification, where the cut values of an input graph are approximately...
research
06/02/2021

Improved Spanning on Theta-5

We show an upper bound of sin(3π/10) /sin(2π/5)-sin(3π/10) <5.70 ...
research
02/12/2023

Infinite Lewis Weights in Spectral Graph Theory

We study the spectral implications of re-weighting a graph by the ℓ_∞-Le...
research
12/23/2017

Distance Labelings on Random Power Law Graphs

A Distance Labeling scheme is a data structure that can answer shortest...
research
02/26/2020

Spectral Sparsification via Bounded-Independence Sampling

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

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners

We study a spectral generalization of classical combinatorial graph span...
research
08/27/2021

An explicit vector algorithm for high-girth MaxCut

We give an approximation algorithm for MaxCut and provide guarantees on ...

Please sign up or login with your details

Forgot password? Click here to reset