# Optimal Lower Bounds for Sketching Graph Cuts

@article{Carlson2019OptimalLB,
title={Optimal Lower Bounds for Sketching Graph Cuts},
author={Charles Carlson and Alexandra Kolla and Nikhil Srivastava and Luca Trevisan},
journal={ArXiv},
year={2019},
volume={abs/1712.10261}
}
• Published 1 December 2017
• Computer Science, Mathematics
• ArXiv
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+\epsilon$ error must use $\Omega(n\log n/\epsilon^2)$ bits of space in the worst case, improving the $\Omega(n/\epsilon^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 Hypergraph Sparsifiers of Nearly Linear Size
• Computer Science
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
• 2022
This work gives a new proof of spectral concentration bounds for sparsifiers of graphs; it avoids linear-algebraic methods, replacing e.g. the usual application of the matrix Bernstein inequality and therefore applies to the (non-linear) hypergraph setting.
Sparsification of Directed Graphs via Cut Balance
• Computer Science
ICALP
• 2021
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).
Towards tight bounds for spectral sparsification of hypergraphs
• Computer Science, Mathematics
STOC
• 2021
A polynomial-time algorithm that, given a hypergraph on n vertices with maximum hyperedge size r, outputs an є-spectral sparsifier with O*(nr) hyperedges, where O* suppresses (є−1 logn)O(1) factors, and lower bounds on the bit complexity of any compression scheme that (1+є)-approximates all the cuts in a given hypergraph are presented.
Sparsification of Balanced Directed Graphs
• Computer Science
ArXiv
• 2020
The upper bounds work for general weighted graphs, while the lower bounds even hold for unweighted graphs with no parallel edges.
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
• Computer Science, Mathematics
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
• 2018
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
Breaking the n-Pass Barrier: A Streaming Algorithm for Maximum Weight Bipartite Matching
• Computer Science, Mathematics
ArXiv
• 2020
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.
Short Cycles via Low-Diameter Decompositions
• Computer Science, Mathematics
SODA
• 2019
Improved algorithms for short cycle decomposition of a graph are presented - a decompositions of an undirected, unweighted graph into edge-disjoint cycles, plus a small number of additional edges, for faster algorithms and improved guarantees for several problems in graph sparsification.
Tight Bounds for the Subspace Sketch Problem with Applications
• Computer Science, Mathematics
SODA
• 2020
The lower bound rules out arbitrary functions of these inner products (and in fact arbitrary data structures built from $A$), and thus rules out the possibility of a singular value decomposition for $\ell_1$ in a very strong sense.
Nearly Tight Spectral Sparsification of Directed Hypergraphs by a Simple Iterative Sampling Algorithm
• Computer Science
ArXiv
• 2022
This paper presents the first algorithm for constructing an ε -spectral sparsifier for a directed hypergraph with O ∗ ( n 2 ) hyperarcs and shows the first non-trivial lower bound of Ω( n 2 /ε ) .
Flow Metrics on Graphs
• Computer Science
ArXiv
• 2021
A lower bound for the number of edges required for a resistance sparsifier in the worst case is presented, and it is shown that the flow metrics satisfy a stronger version of the triangle inequality, which gives some information about their structure and geometry.

## References

SHOWING 1-10 OF 19 REFERENCES
Approximating s-t minimum cuts in Õ(n2) time
• Computer Science
STOC '96
• 1996
A lineartime construction is given that transforms any graph on n vertices into anO(n log n)-edge graph on the same vertices whose cuts have approximately the same value as the original graph’s.
A general framework for graph sparsification
• Computer Science
STOC '11
• 2011
A key ingredient of the proofs is a natural generalization of Karger's bound on the number of small cuts in an undirected graph, which is likely to be of independent interest.
Twice-ramanujan sparsifiers
• Mathematics, Computer Science
STOC '09
• 2009
It is proved that every graph has a spectral sparsifier with a number of edges linear in its number of vertices, and an elementary deterministic polynomial time algorithm is given for constructing H, which approximates G spectrally at least as well as a Ramanujan expander with dn/2 edges approximates the complete graph.
Surveys in Combinatorics, 1999: Models of Random Regular Graphs
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are
An SDP-based algorithm for linear-sized spectral sparsification
• Mathematics, Computer Science
STOC
• 2017
An algorithm is presented that outputs a (1+ε)-spectral sparsifier of G with O(n/ε2) edges in Ο(m/εO(1)) time, based on a new potential function which is much easier to compute yet has similar guarantees as the potential functions used in previous references.
Models of random regular graphs
This is a survey of results on properties of random regular graphs, together with an exposition of some of the main methods of obtaining these results. Related results on asymptotic enumeration are
• Computer Science, Mathematics
ITCS
• 2016
The results provide the first separation between the sketch size needed for the "for all" and "for each" guarantees for Laplacian matrices.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Computer Science
JACM
• 1995
This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.
A proof of alon's second eigenvalue conjecture
This paper shows the following conjecture of Alon: for sufficiently large n the authors have that "most" d-regular graphs on n vertices have all their eigenvalues except λ1 = d bounded above by 2√d-1 + ε.
Efficient $\widetilde{O}(n/\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse
• Computer Science, Mathematics
• 2017
These algorithms provide nearly-linear time algorithms that, when given a Laplacian matrix $\mathcal{L} \in \mathbb{R}^{n \times n}$ and an error tolerance $\epsilon$, produce $\tilde{O}(n/\ep silon)$-size sketches of both the LaPLacian and its pseudoinverse.