Sparse High Dimensional Expanders via Local Lifts
Inbar Ben Yaacov, Yotam Dikstein, Gal Maor

TL;DR
This paper introduces a new elementary, deterministic method to construct high dimensional expanders with bounded degree, expanding the understanding and availability of such structures without relying on algebraic techniques.
Contribution
The authors present a novel algebra-free, local lift-based construction of bounded degree high dimensional expanders, extending previous algebraic methods and enabling new complex structures.
Findings
Constructed HDXs with bounded face degree using local lifts.
Demonstrated that local lifts of HDXs often preserve expansion properties.
Produced families of HDXs with links of arbitrarily large diameter.
Abstract
High dimensional expanders (HDXs) are a hypergraph generalization of expander graphs. They are extensively studied in the math and TCS communities due to their many applications. Like expander graphs, HDXs are especially interesting for applications when they are bounded degree, namely, if the number of edges adjacent to every vertex is bounded. However, only a handful of constructions are known to have this property, all of which rely on algebraic techniques. In particular, no random or combinatorial construction of bounded degree HDXs is known. As a result, our understanding of these objects is limited. The degree of an -face in an HDX is the number of -faces containing it. In this work we construct HDXs whose higher dimensional faces have bounded degree. This is done by giving an elementary and deterministic algorithm that takes as input a regular -dimensional HDX …
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.
