skip to main content
10.1145/3188745.3188782acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Construction of new local spectral high dimensional expanders

Published:20 June 2018Publication History

ABSTRACT

High dimensional expanders is a vibrant emerging field of study. Nevertheless, the only known construction of bounded degree high dimensional expanders is based on Ramanujan complexes, whereas one dimensional bounded degree expanders are abundant.

In this work we construct new families of bounded degree high dimensional expanders obeying the local spectral expansion property. A property that implies, geometric overlapping, fast mixing of high dimensional random walks, agreement testing and agreement expansion. The construction also yields new families of expander graphs.

The construction is quite elementary and it is presented in a self contained manner; This is in contrary to the highly involved construction of the Ramanujan complexes. The construction is also strongly symmetric; The symmetry of the construction could be used, for example, to obtain good symmetric LDPC codes that were previously based on Ramanujan graphs.

References

  1. Martin R. Bridson and André Haefliger. 1999.Google ScholarGoogle Scholar
  2. Metric spaces of non-positive curvature. (1999), xxii+643 pages. 3- 662- 12494- 9Google ScholarGoogle Scholar
  3. Frank Deutsch. 2001.Google ScholarGoogle Scholar
  4. Best approximation in inner product spaces. CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, Vol. 7. Springer-Verlag, New York. xvi+338 pages. 1- 4684- 9298- 9Google ScholarGoogle Scholar
  5. Irit Dinur and Tali Kaufman. 2017. High dimensional expanders imply agreement expanders. Electronic Colloquium on Computational Complexity (ECCC) (2017).Google ScholarGoogle Scholar
  6. Jan Dymara and Tadeusz Januszkiewicz. 2002.Google ScholarGoogle Scholar
  7. Cohomology of buildings and their automorphism groups. Invent. Math. 150, 3 (2002), 579–627. org/10.1007/s00222- 002- 0242yGoogle ScholarGoogle Scholar
  8. Mikhail Ershov and Andrei Jaikin-Zapirain. 2010.Google ScholarGoogle Scholar
  9. Property (T) for noncommutative universal lattices. Invent. Math. 179, 2 (2010), 303–347. 009- 0218- 2Google ScholarGoogle Scholar
  10. Shai Evra and Tali Kaufman. 2017.Google ScholarGoogle Scholar
  11. Bounded Degree Cosystolic Expanders of Every Dimension. https://arxiv.org/abs/1510.00839. (2017).Google ScholarGoogle Scholar
  12. https://arxiv.org/abs/ 1510.00839Google ScholarGoogle Scholar
  13. Martin Kassabov. 2011. Subspace arrangements and property T. Groups Geom. Dyn. 5, 2 (2011), 445–477.Google ScholarGoogle ScholarCross RefCross Ref
  14. Tali Kaufman and Alexander Lubotzky. 2012. Edge transitive Ramanujan graphs and symmetric LDPC good codes. In STOC’12—Proceedings of the 2012 ACM Symposium on Theory of Computing. ACM, New York, 359–365. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Tali Kaufman and David Mass. 2017. High Dimensional Combinatorial Random Walks and Colorful Expansion. In Innovations in Theoretical Computer Science (ITCS).Google ScholarGoogle Scholar
  16. Tali Kaufman and Izhar Oppenheim. 2017. High Order Random Walks: Beyond Spectral Gap. https://arxiv.org/abs/1707.02799. (2017).Google ScholarGoogle Scholar
  17. https://arxiv.org/abs/1707.Google ScholarGoogle Scholar
  18. 02799Google ScholarGoogle Scholar
  19. Tali Kaufman and Izhar Oppenheim. 2018. Construction of new local spectral high dimensional expanders. https://arxiv.org/abs/1710.05304. (2018).Google ScholarGoogle Scholar
  20. https: //arxiv.org/abs/1710.05304Google ScholarGoogle Scholar
  21. Tali Kaufman and Avi Wigderson. 2016. Symmetric LDPC codes and local testing. Combinatorica 36, 1 (2016), 91–120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Alexander Lubotzky, Beth Samuels, and Uzi Vishne. 2005. Explicit constructions of Ramanujan complexes of type e A d. European J. Combin. 26, 6 (2005), 965–993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Alexander Lubotzky, Beth Samuels, and Uzi Vishne. 2005.Google ScholarGoogle Scholar
  24. Ramanujan complexes of type e A d. Israel J. Math. 149 (2005), 267–299. BF02772543 Probability in mathematics.Google ScholarGoogle Scholar
  25. Izhar Oppenheim. 2017.Google ScholarGoogle Scholar
  26. Averaged projections, angles between groups and strengthening of Banach property (T). Math. Ann. 367, 1-2 (2017), 623–666. 016- 1413- 2Google ScholarGoogle Scholar
  27. Izhar Oppenheim. 2018. Local Spectral Expansion Approach to High Dimensional Expanders Part I: Descent of Spectral Gaps. Discrete Comput. Geom. 59, 2 (2018), 293–330. 017- 9948x Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Izhar Oppenheim. 2018. Local Spectral Expansion Approach to High Dimensional Expanders Part II: Mixing and Geometrical overlapping. https://arxiv.org/abs/ 1803.01320. (2018).Google ScholarGoogle Scholar

Index Terms

  1. Construction of new local spectral high dimensional expanders

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
        June 2018
        1332 pages
        ISBN:9781450355599
        DOI:10.1145/3188745

        Copyright © 2018 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 20 June 2018

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,469of4,586submissions,32%

        Upcoming Conference

        STOC '24
        56th Annual ACM Symposium on Theory of Computing (STOC 2024)
        June 24 - 28, 2024
        Vancouver , BC , Canada

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader