when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.266
URN: urn:nbn:de:0030-drops-34348

Koutis, Ioannis ; Levin, Alex ; Peng, Richard

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices

Dokument 1.pdf (638 KB)


We present three spectral sparsification algorithms that, on input a graph G with n vertices and m edges, return a graph H with n vertices and O(n log n/epsilon^2) edges that provides a strong approximation of G. Namely, for all vectors x and any epsilon>0, we have (1-epsilon) x^T L_G x <= x^T L_H x <= (1+epsilon) x^T L_G x, where L_G and L_H are the Laplacians of the two graphs. The first algorithm is a simple modification of the fastest known algorithm and runs in tilde{O}(m log^2 n) time, an O(log n) factor faster than before. The second algorithm runs in tilde{O}(m log n) time and generates a sparsifier with tilde{O}(n log^3 n) edges. The third algorithm applies to graphs where m>n log^5 n and runs in tilde{O}(m log_{m/ n log^5 n} n time. In the range where m>n^{1+r} for some constant r this becomes softO(m). The improved sparsification algorithms are employed to accelerate linear system solvers and algorithms for computing fundamental eigenvectors of dense SDD matrices.

BibTeX - Entry

  author =	{Ioannis Koutis and Alex Levin and Richard Peng},
  title =	{{Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{266--277},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{Christoph D{\"u}rr and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-34348},
  doi =		{},
  annote =	{Keywords: Spectral sparsification, linear system solving}

Keywords: Spectral sparsification, linear system solving
Seminar: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Issue date: 2012
Date of publication: 24.02.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI