Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes (2310.19149v2)
Abstract: In this note, we give very simple constructions of unique neighbor expander graphs starting from spectral or combinatorial expander graphs of mild expansion. These constructions and their analysis are simple variants of the constructions of LDPC error-correcting codes from expanders, given by Sipser-Spielman SS96, and their analysis. We also show how to obtain expanders with many unique neighbors using similar ideas. There were many exciting results on this topic recently, starting with Asherov-Dinur [AD23] and Hsieh-McKenzie-Mohanty-Paredes [HMMP23], who gave a similar construction of unique neighbor expander graphs, but using more sophisticated ingredients (such as almost-Ramanujan graphs) and a more involved analysis. Subsequent beautiful works of Cohen-Roth-TaShma [CRT23] and Golowich [Gol23] gave even stronger objects (lossless expanders), but also using sophisticated ingredients. The main contribution of this work is that we get much more elementary constructions of unique neighbor expanders and with a simpler analysis.
- Explicit unique-neighbor expanders. In proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), page 73. IEEE Computer Society, 2002.
- Noga Alon and Fan R. K. Chung. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 306(10-11):1068–1071, 2006.
- Bipartite unique-neighbour expanders via ramanujan graphs. CoRR, abs/2301.03072, 2023.
- On-line algorithms for path selection in a nonblocking network. SIAM Journal on Computing, 25(3):600–625, 1996.
- Tensor products of weakly smooth codes are robust. Theory of Computing, 5(1):239–255, 2009.
- HDX condensers. In proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 1649–1664. IEEE Computer Society, 2023.
- Randomness conductors and constant-degree lossless expanders. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 659–668. ACM Press, 2002.
- Robust local testability of tensor products of LDPC codes. In proceedings of the 9th International Workshop on Randomization and Computation (RANDOM), pages 304–315. Springer, 2006.
- Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences, 22(3):407–420, 1981.
- Louis Golowich. New explicit constant-degree lossless expanders. CoRR, abs/2306.07551, 2023.
- Essential coding theory. https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/web-coding-book.pdf, 2023. Accessed: 2023-12-02.
- Expander graphs and their applications. Bulletin of AMS, 43(4):439–561, 2006.
- Explicit two-sided unique-neighbor expanders. CoRR, abs/2302.01212, 2023.
- Nicholas Pippenger. Self-routing superconcentrators. Journal of Computer and System Sciences, 52(1):53–60, 1996.
- The token distribution problem. SIAM Journal on Computing, 18(2):229–243, 1989.
- Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 3–13. IEEE Computer Society, 2000.
- Expander codes. IEEE Transactions on Information Theory, 42(6):1710–1722, 1996.
- R. Tanner. A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 27(5):533–547, 1981.
- Salil P. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science, 7(1-3):1–336, 2012.