Explicit Two-Sided Unique-Neighbor Expanders
Name
3618260.3649705.pdf
Size
351.71 KB
Format
Adobe PDF
Checksum (MD5)
cedadb2367e5dc6ab609be2649151823
Author(s)
Hsieh, Jun-Ting
McKenzie, Theo
Mohanty, Sidhanth
Paredes, Pedro
Date Issued
June 10, 2024
Publisher
ACM
Citation
STOC ’24, June 24–28, 2024, Vancouver, BC, Canada
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3618260.3649705
