[PDF][PDF] Explicit two-sided unique-neighbor expanders
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024•dl.acm.org
We study the problem of constructing explicit sparse graphs that exhibit strong vertex
expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor
expanders, meaning bipartite graphs where small sets contained in both the left and right
bipartitions exhibit unique-neighbor expansion, along with algebraic properties relevant to
constructing quantum codes. Our constructions are obtained from instantiations of the
tripartite line product of a large tripartite spectral expander and a sufficiently good constant …
expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor
expanders, meaning bipartite graphs where small sets contained in both the left and right
bipartitions exhibit unique-neighbor expansion, along with algebraic properties relevant to
constructing quantum codes. Our constructions are obtained from instantiations of the
tripartite line product of a large tripartite spectral expander and a sufficiently good constant …
We study the problem of constructing explicit sparse graphs that exhibit strong vertex expansion. Our main result is the first two-sided construction of imbalanced unique-neighbor expanders, meaning bipartite graphs where small sets contained in both the left and right bipartitions exhibit unique-neighbor expansion, along with algebraic properties relevant to constructing quantum codes.
Our constructions are obtained from instantiations of the tripartite line product of a large tripartite spectral expander and a sufficiently good constant-sized unique-neighbor expander, a new graph product we defined that generalizes the line product and the routed product of previous well-known works. To analyze the vertex expansion of graphs arising from the tripartite line product, we develop a sharp characterization of subgraphs that can arise in bipartite spectral expanders, generalizing previously known results, which may be of independent interest.
By picking appropriate graphs to apply our product to, we give a strongly explicit construction of an infinite family of (d1,d2)-biregular graphs (Gn)n≥ 1 (for large enough d1 and d2) where all sets S with fewer than a small constant fraction of vertices have Ω(d1· |S|) unique-neighbors (assuming d1 ≤ d2). Additionally, we can also guarantee that subsets of vertices of size up to exp(Ω(√log|V(Gn)|)) expand losslessly.
ACM Digital Library以上显示的是最相近的搜索结果。 查看全部搜索结果