Improved Product-Based High-Dimensional Expanders
Louis Golowich

TL;DR
This paper presents an improved combinatorial construction of high-dimensional expanders with near-optimal spectral gap, advancing the understanding and potential applications of these complex structures.
Contribution
The authors introduce a new high-dimensional expander construction based on a modified tensor product, achieving a spectral gap close to the optimal bound, improving upon previous combinatorial methods.
Findings
Spectral gap of $oldsymbol{ ilde{ extstylerac{1}{k^2}}}$ for the new construction.
Quadratic gap from the optimal $oldsymbol{rac{1}{k}}$ bound.
Evidence suggesting the construction's optimality among similar product-based expanders.
Abstract
High-dimensional expanders generalize the notion of expander graphs to higher-dimensional simplicial complexes. In contrast to expander graphs, only a handful of high-dimensional expander constructions have been proposed, and no elementary combinatorial construction with near-optimal expansion is known. In this paper, we introduce an improved combinatorial high-dimensional expander construction, by modifying a previous construction of Liu, Mohanty, and Yang (ITCS 2020), which is based on a high-dimensional variant of a tensor product. Our construction achieves a spectral gap of for random walks on the -dimensional faces, which is only quadratically worse than the optimal bound of . Previous combinatorial constructions, including that of Liu, Mohanty, and Yang, only achieved a spectral gap that is exponentially small in . We also present…
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.
