High dimensional expanders and coset geometries
Tali Kaufman, Izhar Oppenheim

TL;DR
This paper introduces new bounded degree high dimensional expanders using coset geometries, offering simpler, more symmetric constructions with significant implications for geometry, random walks, and coding theory.
Contribution
It presents the first elementary, symmetric construction of high dimensional expanders based on coset geometries, extending known results beyond Ramanujan complexes.
Findings
Constructed new families of high dimensional expanders with local spectral expansion.
Achieved expander graphs close to Ramanujan bounds with near-optimal spectral gaps.
Demonstrated applications in geometric overlapping, fast mixing, and coding theory.
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. This property has a number of important consequences, including geometric overlapping, fast mixing of high dimensional random walks, agreement testing and agreement expansion. Our construction also yields new families of expander graphs which are close to the Ramanujan bound, i.e., their spectral gap is close to optimal. The construction is quite elementary and it is presented in a self contained manner; This is in contrary to the highly involved previously known construction of the Ramanujan complexes. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Coding theory and cryptography · Nanocluster Synthesis and Applications
