Document Open Access Logo

Spectral Sparsification via Bounded-Independence Sampling

Authors Dean Doron, Jack Murtagh, Salil Vadhan, David Zuckerman

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2020.39.pdf
  • Filesize: 0.56 MB
  • 21 pages

Document Identifiers

Author Details

Dean Doron
  • Department of Computer Science, Stanford University, CA, USA
Jack Murtagh
  • School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
Salil Vadhan
  • School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
David Zuckerman
  • Department of Computer Science, University of Texas at Austin, TX, USA

Funding

  • Doron, Dean: Research supported by a Motwani Postdoctoral Fellowship.
  • Murtagh, Jack: Research supported by NSF grant CCF-1763299.
  • Vadhan, Salil: Research supported by NSF grant CCF-1763299 and a Simons Investigator Award.
  • Zuckerman, David: Research supported in part by NSF Grant CCF-1705028 and a Simons Investigator Award (#409864).

Acknowledgements

We thank Jelani Nelson for his insights on spectral sparsification via k-wise independent sampling. We also thank Jarosław Błasiok for helpful discussions about random matrices. The first author would like to thank Tselil Schramm and Amnon Ta-Shma for interesting conversations.

Cite AsGet BibTex

Dean Doron, Jack Murtagh, Salil Vadhan, and David Zuckerman. Spectral Sparsification via Bounded-Independence Sampling. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 39:1-39:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.ICALP.2020.39

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 ≤ log n and an error parameter ε > 0, our algorithm runs in space Õ(k log(N w_max/w_min)) where w_max and w_min are the maximum and minimum edge weights in G, and produces a weighted graph H with Õ(n^(1+2/k)/ε²) edges that spectrally approximates G, in the sense of Spielmen and Teng [Spielman and Teng, 2004], up to an error of ε. Our algorithm is based on a new bounded-independence analysis of Spielman and Srivastava’s effective resistance based edge sampling algorithm [Spielman and Srivastava, 2011] and uses results from recent work on space-bounded Laplacian solvers [Jack Murtagh et al., 2017]. 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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • Spectral sparsification
  • Derandomization
  • Space complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. AmirMahdi Ahmadinejad, Jonathan Kelner, Jack Murtagh, John Peebles, Aaron Sidford, and Salil Vadhan. High-precision estimation of random walks in small space. arXiv preprint, 2019. URL: http://arxiv.org/abs/1912.04524.
  2. Zeyuan Allen-Zhu, Zhenyu Liao, and Lorenzo Orecchia. Spectral sparsification and regret minimization beyond matrix multiplicative updates. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing (STOC 2015), pages 237-245. ACM, 2015. Google Scholar
  3. Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of algorithms, 7(4):567-583, 1986. Google Scholar
  4. Noga Alon and Asaf Nussboim. k-wise independent random graphs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pages 813-822. IEEE, 2008. Google Scholar
  5. Joshua Batson, Daniel A. Spielman, and Nikhil Srivastava. Twice-ramanujan sparsifiers. SIAM Review, 56(2):315-334, 2014. Google Scholar
  6. András A. Benczúr and David R. Karger. Approximating s-t minimum cuts in Õ(n²) time. In STOC, volume 96, pages 47-55. Citeseer, 1996. Google Scholar
  7. Norman L. Biggs and Alan G. Boshier. Note on the girth of Ramanujan graphs. Journal of Combinatorial Theory, Series B, 49(2):190-194, 1990. Google Scholar
  8. Béla Bollobás. Modern graph theory, volume 184. Springer Science & Business Media, 2013. Google Scholar
  9. Richard Y. Chen, Alex Gittens, and Joel A. Tropp. The masked sample covariance estimator: An analysis using matrix concentration inequalities. Information and Inference: A Journal of the IMA, 1(1):2-20, 2012. Google Scholar
  10. L. Paul Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39(2):205-219, 1989. Google Scholar
  11. Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, and Shang-Hua Teng. Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC 2011), pages 273-282. ACM, 2011. Google Scholar
  12. Timothy Chu, Yu Gao, Richard Peng, Sushant Sachdeva, Saurabh Sawlani, and Junxing Wang. Graph sparsification, spectral sketches, and faster resistance computation, via short cycle decompositions. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), pages 361-372. IEEE, 2018. Google Scholar
  13. Michael B. Cohen, Jonathan Kelner, Rasmus Kyng, John Peebles, Richard Peng, Anup B. Rao, and Aaron Sidford. Solving directed Laplacian systems in nearly-linear time through sparse LU factorizations. In Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2018), pages 898-909. IEEE, 2018. Google Scholar
  14. Michael B. Cohen, Jonathan Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, and Adrian Vladu. Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC 2017), pages 410-419. ACM, 2017. Google Scholar
  15. Michael B. Cohen, Jonathan Kelner, John Peebles, Richard Peng, Aaron Sidford, and Adrian Vladu. Faster algorithms for computing the stationary distribution, simulating random walks, and more. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), pages 583-592. IEEE, 2016. Google Scholar
  16. Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu. Solving SDD linear systems in nearly mlog^1/2n time. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014), pages 343-352. ACM, 2014. Google Scholar
  17. Michael B Cohen, Aleksander Madry, Piotr Sankowski, and Adrian Vladu. Negative-weight shortest paths and unit capacity minimum cost flow in Õ(m^10/7log W) time. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pages 752-771. SIAM, 2017. Google Scholar
  18. Dean Doron, François Le Gall, and Amnon Ta-Shma. Probabilistic logarithmic-space algorithms for Laplacian solvers. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017), pages 41:1-41:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2017. Google Scholar
  19. Dean Doron, Jack Murtagh, Salil Vadhan, and David Zuckerman. Spectral sparsification via bounded-independence sampling. Electronic Colloquium on Computational Complexity (ECCC), 2020. Google Scholar
  20. Paul Erdős and Horst Sachs. Reguläre graphen gegebener taillenweite mit minimaler knotenzahl. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe, 12(251-257):22, 1963. Google Scholar
  21. Geoffrey Exoo and Robert Jajcay. Dynamic cage survey. Electron. J. Combin, 15(16):4, 2008. Google Scholar
  22. Ronald M. Foster. The average impedance of an electrical network. Contributions to Applied Mechanics (Reissner Anniversary Volume), pages 333-340, 1949. Google Scholar
  23. A. Joffe. On a set of almost deterministic k-independent random variables. The Annals of Probability, 2(1):161-162, 1974. Google Scholar
  24. Jonathan A. Kelner, Yin Tat Lee, Lorenzo Orecchia, and Aaron Sidford. An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pages 217-226. SIAM, 2014. Google Scholar
  25. Jonathan A. Kelner and Aleksander Madry. Faster generation of random spanning trees. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019), pages 13-21. IEEE, 2009. Google Scholar
  26. Jonathan A. Kelner, Lorenzo Orecchia, Aaron Sidford, and Zeyuan Allen Zhu. A simple, combinatorial algorithm for solving SDD systems in nearly-linear time. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pages 911-920. ACM, 2013. Google Scholar
  27. Ioannis Koutis, Gary L. Miller, and Richard Peng. A nearly-m log n time solver for SDD linear systems. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), pages 590-598. IEEE, 2011. Google Scholar
  28. Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving SDD linear systems. SIAM Journal on Computing, 43(1):337-354, 2014. Google Scholar
  29. Ioannis Koutis, Gary L. Miller, and David Tolliver. Combinatorial preconditioners and multilevel solvers for problems in computer vision and image processing. In International Symposium on Visual Computing, pages 1067-1078. Springer, 2009. Google Scholar
  30. Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman. Sparsified Cholesky and multigrid solvers for connection Laplacians. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC 2016), pages 842-850. ACM, 2016. Google Scholar
  31. Rasmus Kyng and Sushant Sachdeva. Approximate Gaussian elimination for Laplacians-fast, sparse, and simple. In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), pages 573-582. IEEE, 2016. Google Scholar
  32. Felix Lazebnik, Vasiliy A. Ustimenko, and Andrew J. Woldar. A new series of dense graphs of high girth. Bulletin of the American mathematical society, 32(1):73-79, 1995. Google Scholar
  33. Yin Tat Lee, Satish Rao, and Nikhil Srivastava. A new approach to computing maximum flows using electrical flows. In Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pages 755-764. ACM, 2013. Google Scholar
  34. Yin Tat Lee and Aaron Sidford. Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), pages 147-156. IEEE, 2013. Google Scholar
  35. Yin Tat Lee and He Sun. Constructing linear-sized spectral sparsification in almost-linear time. In Proceedings of the 56th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2015), pages 250-269. IEEE, 2015. Google Scholar
  36. Yin Tat Lee and He Sun. An SDP-based algorithm for linear-sized spectral sparsification. In Proceedings of the 49th Annual ACM Symposium on Theory of Computing (STOC 2017), pages 678-687. ACM, 2017. Google Scholar
  37. Yang P. Liu and Aaron Sidford. Faster energy maximization for faster maximum flow. arXiv preprint, 2019. URL: http://arxiv.org/abs/1910.14276.
  38. Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988. Google Scholar
  39. Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036-1053, 1986. Google Scholar
  40. Aleksander Madry, Damian Straszak, and Jakub Tarnawski. Fast generation of random spanning trees and the effective resistance metric. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pages 2019-2036. SIAM, 2014. Google Scholar
  41. Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil P. Vadhan. Derandomization beyond connectivity: Undirected Laplacian systems in nearly logarithmic space. In Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2017), pages 801-812. IEEE, 2017. Google Scholar
  42. Jack Murtagh, Omer Reingold, Aaron Sidford, and Salil P. Vadhan. Deterministic approximation of random walks in small space. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019), pages 42:1-42:22. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019. Google Scholar
  43. Lorenzo Orecchia, Sushant Sachdeva, and Nisheeth K. Vishnoi. Approximating the exponential, the Lanczos method and an Õ(m)-time spectral algorithm for balanced separator. In Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC 2012), pages 1141-1160. ACM, 2012. Google Scholar
  44. Richard Peng and Daniel A. Spielman. An efficient parallel solver for SDD linear systems. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC 2014), pages 333-342. ACM, 2014. Google Scholar
  45. Robert Qiu and Michael Wicks. Cognitive networked sensing and big data. Springer, 2014. Google Scholar
  46. Omer Reingold. Undirected connectivity in log-space. J. ACM, 55(4), 2008. Google Scholar
  47. Eyal Rozenman and Salil Vadhan. Derandomized squaring of graphs. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, pages 436-447. Springer, 2005. Google Scholar
  48. Mark Rudelson and Roman Vershynin. Sampling from large matrices: An approach through geometric functional analysis. Journal of the ACM (JACM), 54(4):21, 2007. Google Scholar
  49. Aaron Schild. An almost-linear time algorithm for uniform random spanning tree generation. In Proceedings of the 50th Annual ACM Symposium on Theory of Computing (STOC 2018), pages 214-227. ACM, 2018. Google Scholar
  50. Daniel A. Spielman. Yale Applied Mathematics 561/Computer Science 662, Lecture Notes: Spectral Graph Theory, November 2015. URL: http://www.cs.yale.edu/homes/spielman/561/lect17-15.pdf.
  51. Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6):1913-1926, 2011. Google Scholar
  52. Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pages 81-90, 2004. Google Scholar
  53. Anastasios Zouzias. A matrix hyperbolic cosine algorithm and applications. In International Colloquium on Automata, Languages, and Programming (ICALP 2012), pages 846-858. Springer, 2012. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact