Spectral Sparsification via Bounded-Independence Sampling
(2002.11237)Abstract
We give a deterministic, nearly logarithmic-space algorithm for mild spectral sparsification of undirected graphs. Given a weighted, undirected graph $G$ on $n$ vertices described by a binary string of length $N$, an integer $k\leq \log n$, and an error parameter $\epsilon > 0$, our algorithm runs in space $\tilde{O}(k\log (N\cdot w{\mathrm{max}}/w{\mathrm{min}}))$ where $w{\mathrm{max}}$ and $w{\mathrm{min}}$ are the maximum and minimum edge weights in $G$, and produces a weighted graph $H$ with $\tilde{O}(n{1+2/k}/\epsilon2)$ edges that spectrally approximates $G$, in the sense of Spielmen and Teng [ST04], up to an error of $\epsilon$. Our algorithm is based on a new bounded-independence analysis of Spielman and Srivastava's effective resistance based edge sampling algorithm [SS08] and uses results from recent work on space-bounded Laplacian solvers [MRSV17]. In particular, we demonstrate an inherent tradeoff (via upper and lower bounds) between the amount of (bounded) independence used in the edge sampling algorithm, denoted by $k$ above, and the resulting sparsity that can be achieved.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.