A Sublinear Time Tester for Max-Cut on Clusterable Graphs

Authors Agastya Vibhuti Jha, Akash Kumar



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.91.pdf
  • Filesize: 0.84 MB
  • 17 pages

Document Identifiers

Author Details

Agastya Vibhuti Jha
  • École polytechnique fédérale de Lausanne, Switzerland
Akash Kumar
  • Indian Institute of Technology, Bombay, India

Acknowledgements

We sincerely thank Michael Kapralov for insightful discussions at the beginning of the project. We also would like to thank Kshiteej Sheth and Weronika Wrozs-Kominska for being helping us bounce off ideas.

Cite AsGet BibTex

Agastya Vibhuti Jha and Akash Kumar. A Sublinear Time Tester for Max-Cut on Clusterable Graphs. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 91:1-91:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.91

Abstract

One natural question in the area of sublinear time algorithms asks whether we can distinguish between graphs with max-cut value at least 1-ε from graphs with max-cut value at most 1/2+ε in the adjacency list model where we can make degree queries and neighbor queries. Chiplunkar, Kapralov, Khanna, Mousavifar, and Peres (FOCS' 18) showed that in graphs of bounded degree, one cannot hope for a factor 1/2+ε approximation to the max-cut value in time n^{1/2+o(ε)}. Recently, Peng and Yoshida (SODA '23) obtained o(n) time algorithms which can distinguish expanders with max-cut value at least 1-ε from expanders with small max-cut value (their running time is n^{1/2+O(ε)}). In this paper, going beyond the results of Peng-Yoshida, we develop sublinear time algorithms for this problem on clusterable graphs (which is a graph class with a good community structure). Our algorithms run in ≈ n^{0.5001+ O(ε)} time. A natural extension of Peng-Yoshida approach does not seem to work for clusterable graphs. Indeed, their random walk based technique tracks the 𝓁₂ length of random walk vectors and they exploit the difference in the length of these vectors to tell apart expanders with large cut value from expanders with small cut-value. Such approaches fail to be reliable when graph has loosely connected clusters. Taking inspiration from [Ashish Chiplunkar et al., 2018], we exploit the more refined geometry of spectra of clusterable graphs which leads to our sublinear time implementation. We prove a novel spectral lemma which shows that in a spectral expander 2 - λ_{n-1} ≥ Ω(λ₂). This lemma is leveraged to show that there is a suitable difference between spectra of clusterable graphs with large cut value and spectra of clusterable graphs with small cut value. We use this gap to obtain our sublinear time implementation. To do this, we obtain a nuanced understanding of the eigenvector structure of clusterable graphs and in particular, we show that the eigenvectors of the normalized Laplacian of a clusterable graph, corresponding to eigenvalues which are close to 2 have a small infinity norm.

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Mathematics of computing → Spectra of graphs
Keywords
  • Sublinear Algorithms
  • Graph Algorithms
  • Clusterable Graphs
  • Property Testung

Metrics

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

References

  1. Sanjeev Arora, Boaz Barak, and David Steurer. Subexponential algorithms for unique games and related problems. J. ACM, 62(5):42:1-42:25, 2015. Google Scholar
  2. Boaz Barak, Prasad Raghavendra, and David Steurer. Rounding semidefinite programming hierarchies via global correlation. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 472-481. IEEE Computer Society, 2011. Google Scholar
  3. Andrej Bogdanov, Kenji Obata, and Luca Trevisan. A lower bound for testing 3-colorability in bounded-degree graphs. In 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pages 93-102. IEEE Computer Society, 2002. Google Scholar
  4. Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna, Aida Mousavifar, and Yuval Peres. Testing graph clusterability: Algorithms and lower bounds. CoRR, abs/1808.04807, 2018. URL: https://arxiv.org/abs/1808.04807.
  5. Artur Czumaj, Pan Peng, and Christian Sohler. Testing cluster structure of graphs. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 723-732. ACM, 2015. Google Scholar
  6. Shayan Oveis Gharan and Luca Trevisan. Partitioning into expanders. In Chandra Chekuri, editor, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 1256-1266. SIAM, 2014. Google Scholar
  7. Grzegorz Gluch, Michael Kapralov, Silvio Lattanzi, Aida Mousavifar, and Christian Sohler. Spectral clustering oracles in sublinear time, 2021. URL: https://arxiv.org/abs/2101.05549.
  8. Michel X. Goemans and David P. Williamson. .879-approximation algorithms for MAX CUT and MAX 2sat. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pages 422-431. ACM, 1994. Google Scholar
  9. Oded Goldreich and Dana Ron. A sublinear bipartiteness tester for bunded degree graphs. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, pages 289-298. ACM, 1998. Google Scholar
  10. Roger A. Horn and Charles R. Johnson. Matrix Analysis. Cambridge University Press, 1985. URL: https://doi.org/10.1017/CBO9780511810817.
  11. Richard M. Karp. Reducibility among combinatorial problems. In Proceedings of a symposium on the Complexity of Computer Computations, New York, USA, pages 85-103. Plenum Press, New York, 1972. Google Scholar
  12. Shiping Liu. Multi-way dual cheeger constants and spectral bounds of graphs. Advances in Mathematics, 268:306-338, 2015. Google Scholar
  13. Pan Peng and Yuichi Yoshida. Sublinear-time algorithms for max cut, max e2lin(q), and unique label cover on expanders, 2022. URL: https://arxiv.org/abs/2210.12601.
  14. Luca Trevisan. Max cut and the smallest eigenvalue. SIAM J. Comput., 41(6):1769-1786, 2012. Google Scholar
  15. Luca Trevisan. Graph theory lecture notes, lecture 02. Notes, 2022. URL: https://lucatrevisan.github.io/41000-22/lecture02.pdf.