Optimal Lower Bounds for Sketching Graph Cuts

@article{Carlson2017OptimalLB,
  title={Optimal Lower Bounds for Sketching Graph Cuts},
  author={Charles Carlson and Alexandra Kolla and Nikhil Srivastava and Luca Trevisan},
  journal={CoRR},
  year={2017},
  volume={abs/1712.10261}
}
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 logn/ǫ) bits of space in the worst case, improving the Ω(n/ǫ) bound of [ACK16] and matching the best known upper bound achieved by spectral sparsifiers [BSS12]. Our proof is based on a rigidity phenomenon for cut (and spectral) approximation which may be of… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 11 times over the past 90 days. VIEW TWEETS