Eigenstripping, Spectral Decay, and Edge-Expansion on Posets

Authors Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, Ruizhe Zhang



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2022.16.pdf
  • Filesize: 0.77 MB
  • 24 pages

Document Identifiers

Author Details

Jason Gaitonde
  • Cornell University, Ithaca, NY, USA
Max Hopkins
  • University of California, San Diego, La Jolla, CA, USA
Tali Kaufman
  • Bar-Ilan University, Ramat-Gan, Israel
Shachar Lovett
  • University of California, San Diego, La Jolla, CA, USA
Ruizhe Zhang
  • The University of Texas at Austin, TX, USA

Cite AsGet BibTex

Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, and Ruizhe Zhang. Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 16:1-16:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16

Abstract

Fast mixing of random walks on hypergraphs (simplicial complexes) has recently led to myriad breakthroughs throughout theoretical computer science. Many important applications, however, (e.g. to LTCs, 2-2 games) rely on a more general class of underlying structures called posets, and crucially take advantage of non-simplicial structure. These works make it clear that the global expansion properties of posets depend strongly on their underlying architecture (e.g. simplicial, cubical, linear algebraic), but the overall phenomenon remains poorly understood. In this work, we quantify the advantage of different poset architectures in both a spectral and combinatorial sense, highlighting how regularity controls the spectral decay and edge-expansion of corresponding random walks. We show that the spectra of walks on expanding posets (Dikstein, Dinur, Filmus, Harsha APPROX-RANDOM 2018) concentrate in strips around a small number of approximate eigenvalues controlled by the regularity of the underlying poset. This gives a simple condition to identify poset architectures (e.g. the Grassmann) that exhibit strong (even exponential) decay of eigenvalues, versus architectures like hypergraphs whose eigenvalues decay linearly - a crucial distinction in applications to hardness of approximation and agreement testing such as the recent proof of the 2-2 Games Conjecture (Khot, Minzer, Safra FOCS 2018). We show these results lead to a tight characterization of edge-expansion on expanding posets in the 𝓁₂-regime (generalizing recent work of Bafna, Hopkins, Kaufman, and Lovett (SODA 2022)), and pay special attention to the case of the Grassmann where we show our results are tight for a natural set of sparsifications of the Grassmann graphs. We note for clarity that our results do not recover the characterization of expansion used in the proof of the 2-2 Games Conjecture which relies on 𝓁_∞ rather than 𝓁₂-structure.

Subject Classification

ACM Subject Classification
  • Theory of computation → Expander graphs and randomness extractors
Keywords
  • High-dimensional expanders
  • posets
  • eposets

Metrics

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

References

  1. 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 (FOCS), pages 180-201. IEEE, 2019. Google Scholar
  2. Vedat Levi Alev and Lap Chi Lau. Improved analysis of higher order random walks and applications. arXiv preprint, 2020. URL: http://arxiv.org/abs/2001.02827.
  3. Nima Anari, Kuikui Liu, and Shayan Oveis Gharan. Spectral independence in high-dimensional expanders and applications to the hardcore model. arXiv preprint, 2020. URL: http://arxiv.org/abs/2001.00303.
  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 Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 1-12, 2019. Google Scholar
  5. Mitali Bafna, Boaz Barak, Pravesh Kothari, Tselil Schramm, and David Steurer. Playing unique games on certified small-set expanders. arXiv preprint, 2020. URL: http://arxiv.org/abs/2006.09969.
  6. Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett. High dimensional expanders: Eigenstripping, pseudorandomness, and unique games. arXiv e-prints, 2020. URL: http://arxiv.org/abs/2011.04658.
  7. Mitali Bafna, Max Hopkins, Tali Kaufman, and Shachar Lovett. Hypercontractivity on high dimensional expanders: a local-to-global approach for higher moments. arXiv preprint, 2021. URL: http://arxiv.org/abs/2111.09444.
  8. Boaz Barak, Pravesh K Kothari, and David Steurer. Small-set expansion in shortcode graph and the 2-to-2 conjecture. arXiv preprint, 2018. URL: http://arxiv.org/abs/1804.08662.
  9. Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Štefankovič, and Eric Vigoda. On mixing of markov chains: Coupling, spectral independence, and entropy factorization. arXiv preprint, 2021. URL: http://arxiv.org/abs/2103.07459.
  10. Andries E Brouwer and Willem H Haemers. Distance-regular graphs. In Spectra of graphs, pages 177-185. Springer, 2012. Google Scholar
  11. Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda. Rapid mixing for colorings via spectral independence. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1548-1557. SIAM, 2021. Google Scholar
  12. Zongchen Chen, Kuikui Liu, and Eric Vigoda. Rapid mixing of glauber dynamics up to uniqueness via contraction. arXiv preprint, 2020. URL: http://arxiv.org/abs/2004.09083.
  13. Zongchen Chen, Kuikui Liu, and Eric Vigoda. Optimal mixing of glauber dynamics: Entropy factorization via high-dimensional expansion. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1537-1550, 2021. Google Scholar
  14. Philippe Delsarte. Association schemes and t-designs in regular semilattices. Journal of Combinatorial Theory, Series A, 20(2):230-243, 1976. Google Scholar
  15. Yotam Dikstein and Irit Dinur. Agreement testing theorems on layered set systems. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 1495-1524. IEEE, 2019. Google Scholar
  16. 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 (APPROX/RANDOM 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018. Google Scholar
  17. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes. Locally testable codes with constant rate, distance, and locality. arXiv preprint, 2021. URL: http://arxiv.org/abs/2111.04808.
  18. Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes. Locally testable codes with constant rate, distance, and locality. arXiv preprint, 2021. URL: http://arxiv.org/abs/2111.04808.
  19. Irit Dinur and Tali Kaufman. High dimensional expanders imply agreement expanders. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pages 974-985. IEEE, 2017. Google Scholar
  20. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. On non-optimally expanding sets in grassmann graphs. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 940-951, 2018. Google Scholar
  21. Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra. Towards a proof of the 2-to-1 games conjecture? In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 376-389, 2018. Google Scholar
  22. Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang. Rapid mixing from spectral independence beyond the boolean domain. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1558-1577. SIAM, 2021. Google Scholar
  23. Ernst Fischer. Über quadratische formen mit reellen koeffizienten. Monatshefte für Mathematik und Physik, 16(1):234-249, 1905. Google Scholar
  24. Jason Gaitonde, Max Hopkins, Tali Kaufman, Shachar Lovett, and Ruizhe Zhang. Eigenstripping, spectral decay, and edge-expansion on posets. CoRR, abs/2205.00644, 2022. URL: https://doi.org/10.48550/arXiv.2205.00644.
  25. Tom Gur, Noam Lifshitz, and Siqi Liu. Hypercontractivity on high dimensional expanders: Approximate efron-stein decompositions for epsilon-product spaces. arXiv preprint, 2021. URL: http://arxiv.org/abs/2111.09375.
  26. Max Hopkins and Ting-Chun Lin. Explicit lower bounds against ω(n)-rounds of sum-of-squares. arXiv preprint, 2022. URL: http://arxiv.org/abs/2204.11469.
  27. Roger A Horn, Noah H Rhee, and So Wasin. Eigenvalue inequalities and equalities. Linear Algebra and its Applications, 270(1-3):29-44, 1998. Google Scholar
  28. Vishesh Jain, Huy Tuan Pham, and Thuy Duong Vuong. Spectral independence, coupling with the stationary distribution, and the spectral gap of the glauber dynamics. arXiv preprint, 2021. URL: http://arxiv.org/abs/2105.01201.
  29. Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava, and Madhur Tulsiani. Unique decoding of explicit epsilon-balanced codes near the gilbert-varshamov bound. arXiv preprint, 2020. URL: http://arxiv.org/abs/2011.05500.
  30. Fernando Granha Jeronimo, Shashank Srivastava, and Madhur Tulsiani. Near-linear time decoding of ta-shma’s codes via splittable regularity. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1527-1536, 2021. Google Scholar
  31. Tali Kaufman and David Mass. High dimensional combinatorial random walks and colorful expansion. arXiv preprint, 2016. URL: http://arxiv.org/abs/1604.02947.
  32. Tali Kaufman and David Mass. Local-to-global agreement expansion via the variance method. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020. Google Scholar
  33. Tali Kaufman and Izhar Oppenheim. High order random walks: Beyond spectral gap. Combinatorica, pages 1-37, 2020. Google Scholar
  34. Tali Kaufman and Ran J Tessler. Local to global high dimensional expansion and garland’s method for general posets. arXiv preprint, 2021. URL: http://arxiv.org/abs/2101.12621.
  35. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 767-775, 2002. Google Scholar
  36. Subhash Khot, Dor Minzer, Dana Moshkovitz, and Muli Safra. Small set expansion in the johnson graph. In Electronic Colloquium on Computational Complexity (ECCC), volume 25, page 78, 2018. Google Scholar
  37. Subhash Khot, Dor Minzer, and Muli Safra. On independent sets, 2-to-2 games, and grassmann graphs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 576-589, 2017. Google Scholar
  38. Subhash Khot and Nisheeth K Vishnoi. On the unique games conjecture. In FOCS, volume 5, page 3. Citeseer, 2005. Google Scholar
  39. Anthony Leverrier and Gilles Zémor. Quantum tanner codes. arXiv preprint, 2022. URL: http://arxiv.org/abs/2202.13641.
  40. Ting-Chun Lin and Min-Hsiu Hsieh. c3-local testable codes from lossless expanders. arXiv preprint, 2022. URL: http://arxiv.org/abs/2201.11369.
  41. Kuikui Liu. From coupling to spectral independence and blackbox comparison with the down-up walk. arXiv preprint, 2021. URL: http://arxiv.org/abs/2103.11609.
  42. Pavel Panteleev and Gleb Kalachev. Asymptotically good quantum and locally testable classical ldpc codes. arXiv preprint, 2021. URL: http://arxiv.org/abs/2111.03654.
  43. Richard P Stanley. Differential posets. Journal of the American Mathematical Society, 1(4):919-961, 1988. Google Scholar
  44. Khot Subhash, Dor Minzer, and Muli Safra. Pseudorandom sets in grassmann graph have near-perfect expansion. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pages 592-601. IEEE, 2018. Google Scholar
  45. Qing Zou. The q-binomial inverse formula and a recurrence relation for the q-catalan-qi numbers. J. Math. Anal, 8(1):176-182, 2017. 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