Ioannis Koutis
Abstract
We study algorithms for spectral graph sparsification. The input is a graph G with n vertices and m edges, and the output is a sparse graph G˜ that approximates G in an algebraic sense. Concretely, for all vectors x and any ϵ > 0, the graph G˜ satisfies (1-ϵ )xTLGx ≤ xT LG˜x ≤ (1+ϵ)xT LGx, where LG and G˜ are the Laplacians of G and G˜ respectively.
The first contribution of this article applies to all existing sparsification algorithms that rely on solving solving linear systems on graph Laplacians. These algorithms are the fastest known to date. Specifically, we show that less precision is required in the solution of the linear systems, leading to speedups by an O(log n) factor. We also present faster sparsification algorithms for slightly dense graphs:
— An O(mlog n) time algorithm that generates a sparsifier with O(nlog 3n/ϵ2) edges.
— An O(mlog log n) time algorithm for graphs with more than nlog 5nlog log n edges.
— An O(m) algorithm for graphs with more than nlog 10n edges.
— An O(m) algorithm for unweighted graphs with more than nlog 8n edges.
These bounds hold up to factors that are in O(poly(log log n)) and are conjectured to be removable.
- Ittai Abraham and Ofer Neiman. 2012. Using petal-decompositions to build a low stretch spanning tree. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC’12). ACM, New York, NY, 395--406. Google Scholar
Digital Library
- Dimitris Achlioptas. 2003. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences 66, 4, 671--687. DOI:http://dx.doi.org/10.1016/S0022-0000(03)00025-4 Google ScholarDigital Library
- András A. Benczúr and David R. Karger. 1996. Approximating s-t minimum cuts in O(n2) time. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC’96). 47--55. DOI:http://dx.doi.org/10.1145/237814.237827 Google ScholarDigital Library
- Fan Chung. 2007. Random walks and local cuts in graphs. Linear Algebra and Its Applications 423, 1, 22--32.Google ScholarCross Ref
- Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup Rao, and Shen Chen Xu. 2014a. Solving SDD linear systems in nearly mlog1/2n time. In Proceedings of the Symposium on Theory of Computing (STOC’14). ACM, New York, NY, 343--352. DOI:http://dx.doi.org/10.1145/2591796.2591833 Google ScholarDigital Library
- Michael B. Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford. 2014b. Uniform sampling for matrix approximation. Available at http://arxiv.org/abs/1408.5099Google Scholar
- Michael B. Cohen, Gary L. Miller, Jakub W. Pachocki, Richard Peng, and Shen Chen Xu. 2014c. Stretching stretch. Available at http://arxiv.org/abs/1401.2454Google Scholar
- Peter G. Doyle and J. Laurie Snell. 2000. Random Walks and Electric Networks. Mathematical Association of America, Washington, DC.Google Scholar
- Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, and Debmalya Panigrahi. 2011. A general framework for graph sparsification. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). 71--80. Google ScholarDigital Library
- Harold N. Gabow and Robert Endre Tarjan. 1983. A linear-time algorithm for a special case of disjoint set union. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC’83). ACM, New York, NY, 246--251. DOI:http://dx.doi.org/10.1145/800061.808753 Google ScholarDigital Library
- Eran Halperin and Uri Zwick. 1996. Linear time deterministic algorithm for computing spanners for unweighted graphs. Unpublished manuscript.Google Scholar
- William B. Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary Mathematics 26, 189--206.Google ScholarCross Ref
- David R. Karger. 1998. Better random sampling algorithms for flows in undirected graphs. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98). 490--499. http://dl.acm.org/citation.cfm?id=314613.314833 Google ScholarDigital Library
- Jonathan A. Kelner and Alex Levin. 2013. Spectral sparsification in the semi-streaming setting. Theory of Computing Systems 53, 2, 243--262. DOI:http://dx.doi.org/10.1007/s00224-012-9396-1Google ScholarCross Ref
- Ioannis Koutis. 2007. Combinatorial and Algebraic Tools for Optimal Multilevel Algorithms. Ph.D. Dissertation. Carnegie Mellon University, Pittsburgh, PA. Google ScholarDigital Library
- Ioannis Koutis. 2014. Simple parallel and distributed algorithms for spectral graph sparsification. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’14). ACM, New York, 61--66. DOI:http://dx.doi.org/10.1145/2612669.2612676 Google ScholarDigital Library
- Ioannis Koutis, Alex Levin, and Richard Peng. 2012. Improved spectral sparsification and numerical algorithms for SDD matrices. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS’12). 266--277.Google Scholar
- Ioannis Koutis, Gary L. Miller, and Richard Peng. 2011. A nearly-mlog n solver for SDD linear systems. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS’11). http://arxiv.org/abs/1003.2958 Google ScholarDigital Library
- Ioannis Koutis, Gary Miller, and Richard Peng. 2014. Approaching optimality for solving SDD linear systems. SIAM Journal on Computing 43, 1, 337--354. DOI:http://dx.doi.org/10.1137/110845914Google ScholarCross Ref
- Mu Li, Gary L. Miller, and Richard Peng. 2013. Iterative row sampling. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). IEEE, Los Alamitos, CA, 127--136. DOI:http://dx.doi.org/10.1109/FOCS.2013.22 Google ScholarDigital Library
- Daniel Spielman and Nikhil Srivastava. 2011. Graph sparsification by effective resistances. SIAM Journal on Computing 40, 6, 1913--1926. DOI:http://dx.doi.org/10.1137/080734029 Google ScholarDigital Library
- Daniel Spielman and Shang-Hua Teng. 2014. Nearly linear time algorithms for preconditioning and solving symmetric, diagonally dominant linear systems. SIAM Journal on Matrix Analysis and Applications 35, 3, 835--885. DOI:http://dx.doi.org/10.1137/090771430Google ScholarCross Ref
- Daniel A. Spielman and Shang-Hua Teng. 2011. Spectral sparsification of graphs. SIAM Journal on Computing 40, 4, 981--1025. DOI:http://dx.doi.org/10.1137/08074489X Google ScholarDigital Library
- Daniel A. Spielman and Jaeoh Woo. 2009. A note on preconditioning by low-stretch spanning trees. arXiv:0903.2815.Google Scholar
- Robert Endre Tarjan. 1979. Applications of path compression on balanced trees. Journal of the ACM 26, 4, 690--715. Google ScholarDigital Library
Index Terms
- Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices
Recommendations
Simple Parallel and Distributed Algorithms for Spectral Graph Sparsification
We describe simple algorithms for spectral graph sparsification, based on iterative computations of weighted spanners and sampling. Leveraging the algorithms of Baswana and Sen for computing spanners, we obtain the first distributed spectral ...
Towards tight bounds for spectral sparsification of hypergraphs
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingCut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new ...
An SDP-based algorithm for linear-sized spectral sparsification
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of ComputingFor any undirected and weighted graph G=(V,E,w) with n vertices and m edges, we call a sparse subgraph H of G, with proper reweighting of the edges, a (1+ε)-spectral sparsifier if
(1-ε)xTLGx≤xT LH x≤(1+ε)xTLGx
holds for any xΕℝn, where LG and LH are ...
Comments