New Explicit Constant-Degree Lossless Expanders
Louis Golowich
Abstract
We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our construction is simpler to state and analyze than the only prior construction of Capalbo, Reingold, Vadhan, and Wigderson (2002), and achieves improvements in some parameters.
We construct our lossless expanders by imposing the structure of a constant-sized lossless expander "gadget" within the neighborhoods of a large bipartite spectral expander; similar constructions were previously used to obtain the weaker notion of unique-neighbor expansion. Our analysis simply consists of elementary counting arguments and an application of the expander mixing lemma.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers7
- Explicit Lossless Vertex ExpandersJun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner et al.FOCS 2025 · 21 citations
- Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear CodesFernando Granha Jeronimo, Nikhil ShagrithayaSTOC 2026 · 10 citations
- Explicit Two-Sided Vertex Expanders beyond the Spectral BarrierJun-Ting Hsieh, Ting-Chun Lin, Sidhanth Mohanty, Ryan O'Donnell et al.STOC 2025 · 8 citations
- Explicit Two-Sided Unique-Neighbor ExpandersJun-Ting Hsieh, Theo McKenzie, Sidhanth Mohanty, Pedro ParedesSTOC 2024 · 2 citations
- Decoding Quasi-Cyclic Quantum LDPC CodesLouis Golowich, Venkatesan GuruswamiFOCS 2024 · 1 citation
Builds on7
- Asymptotically good Quantum and locally testable classical LDPC codesPavel Panteleev, Gleb KalachevSTOC 2022 · 214 citations
- Quantum Tanner codesAnthony Leverrier, Gilles ZémorFOCS 2022 · 121 citations
- Good Quantum LDPC Codes with Linear Time DecodersIrit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, Thomas VidickSTOC 2023 · 83 citations
- An Efficient Decoder for a Linear Distance Quantum LDPC CodeShouzhen Gu, Christopher A. Pattison, Eugene TangSTOC 2023 · 27 citations
- Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codesAnthony Leverrier, Gilles ZémorSODA 2023 · 10 citations
Related papers
- Unique-neighbor Expanders with Better Expansion for Polynomial-sized SetsYeyuan ChenSODA 2025
- HDX CondensersItay Cohen, Roy Roth, Amnon Ta-ShmaFOCS 2023 · 3 citations
- Streaming and Communication Complexity of Load-Balancing via Matching ContractorsSepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau et al.SODA 2025
- Local and Global Expansion in Random Geometric GraphsSiqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth YangSTOC 2023 · 4 citations
- Almost-Optimal Sublinear Additive SpannersZihan Tan, Tianyi ZhangSTOC 2023 · 1 citation
