Document Open Access Logo

Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes

Authors Anand Louis , Rameesh Paul , Arka Ray

PDF
Thumbnail PDF

File

LIPIcs.SWAT.2024.33.pdf
  • Filesize: 0.77 MB
  • 15 pages

Document Identifiers

Author Details

Anand Louis
  • Indian Institute of Science, Bangalore, India
Rameesh Paul
  • Indian Institute of Science, Bangalore, India
Arka Ray
  • Indian Institute of Science, Bangalore, India

Funding

  • Louis, Anand: Supported in part by SERB Award CRG/2023/002896 and the Walmart Center for Tech Excellence at IISc (CSR Grant WMGT-23-0001).
  • Paul, Rameesh: Supported by Prime Minister’s Research Fellowship, India.
  • Ray, Arka: Supported by the Walmart Center for Tech Excellence at IISc (CSR Grant WMGT-23-0001).

Acknowledgements

We would like to thank Madhur Tulsiani, Fernando Jeronimo, and anonymous referees for their helpful comments.

Cite AsGet BibTex

Anand Louis, Rameesh Paul, and Arka Ray. Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 33:1-33:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.33

Abstract

There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning to k-uniform hypergraphs. There have been two broad directions toward this goal. One generalizes the notion of graph conductance to hypergraph conductance [Louis, Makarychev - TOC'16; Chan, Louis, Tang, Zhang - JACM'18]. In the second approach, one can view a hypergraph as a simplicial complex and study its various topological properties [Linial, Meshulam - Combinatorica'06; Meshulam, Wallach - RSA'09; Dotterrer, Kaufman, Wagner - SoCG'16; Parzanchevski, Rosenthal - RSA'17] and spectral properties [Kaufman, Mass - ITCS'17; Dinur, Kaufman - FOCS'17; Kaufman, Openheim - STOC'18; Oppenheim - DCG'18; Kaufman, Openheim - Combinatorica'20]. In this work, we attempt to bridge these two directions of study by relating the spectrum of up-down walks and swap walks on the simplicial complex, a downward closed set system, to hypergraph expansion. More precisely, we study the simplicial complex obtained by downward closing the given hypergraph and random walks between its levels X(l), i.e., the sets of cardinality l. In surprising contrast to random walks on graphs, we show that the spectral gap of swap walks and up-down walks between level m and l with 1 < m ⩽ l cannot be used to infer any bounds on hypergraph conductance. Moreover, we show that the spectral gap of swap walks between X(1) and X(k-1) cannot be used to infer any bounds on hypergraph conductance. In contrast, we give a Cheeger-like inequality relating the spectra of walks between level 1 and l for any l ⩽ k to hypergraph expansion. This is a surprising difference between swaps walks and up-down walks! Finally, we also give a construction to show that the well-studied notion of link expansion in simplicial complexes cannot be used to bound hypergraph expansion in a Cheeger-like manner.

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
Keywords
  • Sparse Cuts
  • Random Walks
  • Link Expansion
  • Hypergraph Expansion
  • Simplicial Complexes
  • High Dimensional Expander
  • Threshold Rank

Metrics

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

Related Versions

References

  1. Dorna Abdolazimi, Kuikui Liu, and Shayan Oveis Gharan. A matrix trickle-down theorem on simplicial complexes and applications to sampling colorings. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science - FOCS 2021, pages 161-172. IEEE Computer Soc., Los Alamitos, CA, 2022. Google Scholar
  2. Vedat Levi Alev, Fernando Granha Jeronimo, and Madhur Tulsiani. Approximating constraint satisfaction problems on high-dimensional expanders. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, pages 180-201. IEEE Comput. Soc. Press, Los Alamitos, CA, 2019. URL: https://doi.org/10.1109/FOCS.2019.00021.
  3. Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high-dimensional expanders and applications to the hardcore model. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, pages 1319-1330. IEEE Computer Soc., Los Alamitos, CA, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00125.
  4. Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant. Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid. In STOC'19 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 1-12. ACM, New York, 2019. URL: https://doi.org/10.1145/3313276.3316385.
  5. Sanjeev Arora, Boaz Barak, and David Steurer. Subexponential algorithms for unique games and related problems. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - FOCS 2010, pages 563-572. IEEE Computer Soc., Los Alamitos, CA, 2010. Google Scholar
  6. Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett. High dimensional expanders: Eigenstripping, pseudorandomness, and unique games. In Joseph (Seffi) Naor and Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 1069-1128. SIAM, 2022. URL: https://doi.org/10.1137/1.9781611977073.47.
  7. Boaz Barak, Prasad Raghavendra, and David Steurer. Rounding semidefinite programming hierarchies via global correlation. In 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - FOCS 2011, pages 472-481. IEEE Computer Soc., Los Alamitos, CA, 2011. URL: https://doi.org/10.1109/FOCS.2011.95.
  8. T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, and Chenzi Zhang. Spectral properties of hypergraph Laplacian and approximation algorithms. J. ACM, 65(3):Art. 15, 48, 2018. URL: https://doi.org/10.1145/3178123.
  9. Yotam Dikstein and Irit Dinur. Agreement testing theorems on layered set systems. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, pages 1495-1524. IEEE Comput. Soc. Press, Los Alamitos, CA, 2019. URL: https://doi.org/10.1109/FOCS.2019.00088.
  10. Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha. Boolean function analysis on high-dimensional expanders. In Approximation, randomization, and combinatorial optimization. Algorithms and techniques, volume 116 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 38, 20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. Google Scholar
  11. Irit Dinur and Tali Kaufman. High dimensional expanders imply agreement expanders. In 58th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2017, pages 974-985. IEEE Computer Soc., Los Alamitos, CA, 2017. URL: https://doi.org/10.1109/FOCS.2017.94.
  12. Dominic Dotterrer, Tali Kaufman, and Uli Wagner. On expansion and topological overlap. In Sándor P. Fekete and Anna Lubiw, editors, 32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA, volume 51 of LIPIcs, pages 35:1-35:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. URL: https://doi.org/10.4230/LIPIcs.SoCG.2016.35.
  13. Anna Gundert and May Szedlák. Higher dimensional discrete cheeger inequalities. J. Comput. Geom., 6(2):54-71, 2015. URL: https://doi.org/10.20382/jocg.v6i2a4.
  14. Anna Gundert and Uli Wagner. On eigenvalues of random complexes. Israel Journal of Mathematics, 216:545-582, 2016. Google Scholar
  15. Venkatesan Guruswami and Ali Kemal Sinop. Lasserre hierarchy, higher eigenvalues, and approximation schemes for graph partitioning and quadratic integer programming with PSD objectives. In Rafail Ostrovsky, editor, IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 482-491. IEEE Computer Society, 2011. URL: https://doi.org/10.1109/FOCS.2011.36.
  16. Kenneth Hoffman and Ray Kunze. Linear Algebra. Prentice-Hall, 2nd edition, 1971. Google Scholar
  17. Fernando Granha Jeronimo, Shashank Srivastava, and Madhur Tulsiani. Near-linear time decoding of ta-shma’s codes via splittable regularity. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 1527-1536. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451126.
  18. Jürgen Jost and Dong Zhang. Cheeger inequalities on simplicial complexes. arXiv preprint, 2023. URL: https://arxiv.org/abs/2302.01069.
  19. Tali Kaufman and David Mass. High dimensional random walks and colorful expansion. In 8th Innovations in Theoretical Computer Science Conference, volume 67 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 4, 27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. Google Scholar
  20. Tali Kaufman and Izhar Oppenheim. Construction of new local spectral high dimensional expanders. In STOC'18 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 773-786. ACM, New York, 2018. URL: https://doi.org/10.1145/3188745.3188782.
  21. Tali Kaufman and Izhar Oppenheim. High order random walks: Beyond spectral gap. Comb., 40(2):245-281, 2020. URL: https://doi.org/10.1007/S00493-019-3847-0.
  22. Nathan Linial and Roy Meshulam. Homological connectivity of random 2-complexes. Comb., 26(4):475-487, 2006. URL: https://doi.org/10.1007/s00493-006-0027-9.
  23. Anand Louis and Yury Makarychev. Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion. Theory Comput., 12:Paper No. 17, 25, 2016. URL: https://doi.org/10.4086/toc.2016.v012a017.
  24. Roy Meshulam and N. Wallach. Homological connectivity of random k-dimensional complexes. Random Struct. Algorithms, 34(3):408-417, 2009. URL: https://doi.org/10.1002/rsa.20238.
  25. Izhar Oppenheim. Local spectral expansion approach to high dimensional expanders Part II: Mixing and geometrical overlapping. Discrete Comput. Geom., 64(3):1023-1066, 2020. URL: https://doi.org/10.1007/s00454-019-00117-7.
  26. Ori Parzanchevski and Ron Rosenthal. Simplicial complexes: spectrum, homology and random walks. Random Structures Algorithms, 50(2):225-261, 2017. URL: https://doi.org/10.1002/rsa.20657.
  27. Ori Parzanchevski, Ron Rosenthal, and Ran J. Tessler. Isoperimetric inequalities in simplicial complexes. Comb., 36(2):195-227, 2016. URL: https://doi.org/10.1007/s00493-014-3002-x.
  28. John Steenbergen, Caroline J. Klivans, and Sayan Mukherjee. A cheeger-type inequality on simplicial complexes. Adv. Appl. Math., 56:56-77, 2014. URL: https://doi.org/10.1016/j.aam.2014.01.002.
  29. Luca Trevisan. Max cut and the smallest eigenvalue. SIAM J. Comput., 41(6):1769-1786, 2012. URL: https://doi.org/10.1137/090773714.
  30. Yuichi Yoshida. Cheeger inequalities for submodular transformations. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 2582-2601. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.160.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact