Explicit Two-Sided Unique-Neighbor Expanders
Pages 788 - 799
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.
References
[1]
Noga Alon and Michael Capalbo. 2002. Explicit unique-neighbor expanders. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. 73–79.
[2]
Noga Alon and Fan RK Chung. 1988. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72, 1-3 (1988), 15–19.
[3]
Noga Alon, Shlomo Hoory, and Nathan Linial. 2002. The Moore bound for irregular graphs. Graphs and Combinatorics, 18, 1 (2002), 53–57.
[4]
Anurag Anshu, Nikolas P Breuckmann, and Chinmay Nirkhe. 2023. NLTS Hamiltonians from good quantum codes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 1090–1096.
[5]
Sanjeev Arora, FT Leighton, and Bruce M Maggs. 1996. On-Line Algorithms for Path Selection in a Nonblocking Network. SIAM J. Comput., 25, 3 (1996), 600–625.
[6]
Ron Asherov and Irit Dinur. 2023. Bipartite unique-neighbour expanders via Ramanujan graphs. arXiv preprint arXiv:2301.03072.
[7]
Cristina Ballantine, Brooke Feigon, Radhika Ganapathy, Janne Kool, Kathrin Maurischat, and Amy Wooding. 2015. Explicit construction of Ramanujan bigraphs. In Women in Numbers Europe: Research Directions in Number Theory. 1–16.
[8]
Hyman Bass. 1992. The Ihara-Selberg zeta function of a tree lattice. International Journal of Mathematics, 3, 06 (1992), 717–797.
[9]
Oren Becker. 2016. Symmetric unique neighbor expanders and good LDPC codes. Discrete Applied Mathematics, 211 (2016), 211–216.
[10]
Eli Ben-Sasson and Michael Viderman. 2009. Tensor products of weakly smooth codes are robust. Theory of Computing, 5, 1 (2009), 239–255.
[11]
Radu Berinde, Anna C Gilbert, Piotr Indyk, Howard Karloff, and Martin J Strauss. 2008. Combining geometry and combinatorics: A unified approach to sparse signal recovery. In 2008 46th Annual Allerton Conference on Communication, Control, and Computing. 798–805.
[12]
Michael Capalbo, Omer Reingold, Salil Vadhan, and Avi Wigderson. 2002. Randomness conductors and constant-degree lossless expanders. In 34th Annual ACM Symposium on Theory of Computing. 659–668.
[13]
Itay Cohen, Roy Roth, and Amnon Ta-Shma. 2023. HDX condensers. In 64th Annual Symposium on Foundations of Computer Science (FOCS).
[14]
Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, and Shahar Mozes. 2022. Locally Testable Codes with constant rate, distance, and locality. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. 357–374.
[15]
Irit Dinur, Yuval Filmus, Prahladh Harsha, and Madhur Tulsiani. 2021. Explicit SoS Lower Bounds from High-Dimensional Expanders. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021).
[16]
Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick. 2022. Good Quantum LDPC Codes with Linear Time Decoders. arXiv preprint arXiv:2206.07750.
[17]
Irit Dinur, Madhu Sudan, and Avi Wigderson. 2006. Robust local testability of tensor products of LDPC codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. 304–315.
[18]
Andrzej Dudek, Alan Frieze, Andrzej Ruciński, and Matas Šileikis. 2017. Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity. Journal of Combinatorial Theory, Series B, 122 (2017), 719–740.
[19]
Zhou Fan and Andrea Montanari. 2017. How well do local algorithms solve semidefinite programs? In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. 604–614.
[20]
Alan Frieze and Michał Karoński. 2016. Introduction to random graphs. Cambridge University Press.
[21]
Louis Golowich. 2023. New Explicit Constant-Degree Lossless Expanders. arXiv preprint arXiv:2306.07551.
[22]
Dima Grigoriev. 2001. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theoretical Computer Science, 259, 1-2 (2001), 613–622.
[23]
Shouzhen Gu, Christopher A Pattison, and Eugene Tang. 2022. An efficient decoder for a linear distance quantum LDPC code. arXiv preprint arXiv:2206.06557.
[24]
Venkatesan Guruswami, James R Lee, and Alexander Razborov. 2010. Almost Euclidean subspaces of ℓ _1^N via expander codes. Combinatorica, 30, 1 (2010), 47–68.
[25]
Venkatesan Guruswami, Peter Manohar, and Jonathan Mosheiff. 2022. ℓ _p-Spread and Restricted Isometry Properties of Sparse Random Matrices. In 37th Computational Complexity Conference (CCC 2022).
[26]
Venkatesan Guruswami, Christopher Umans, and Salil Vadhan. 2009. Unbalanced expanders and randomness extractors from Parvaresh–Vardy codes. Journal of the ACM (JACM), 56, 4 (2009), 1–34.
[27]
Ki-ichiro Hashimoto. 1989. Zeta functions of finite graphs and representations of p-adic groups. In Automorphic forms and geometry of arithmetic varieties. Elsevier, 211–280.
[28]
Wassily Hoeffding. 1963. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58 (1963), 13–30.
[29]
Shlomo Hoory, Nathan Linial, and Avi Wigderson. 2006. Expander graphs and their applications. Bull. Amer. Math. Soc., 43, 4 (2006), 439–561.
[30]
Max Hopkins and Ting-Chun Lin. 2022. Explicit Lower Bounds Against Ω (n)-Rounds of Sum-of-Squares. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 662–673.
[31]
Jun-Ting Hsieh, Pravesh K Kothari, and Sidhanth Mohanty. 2023. A simple and sharper proof of the hypergraph Moore bound. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2324–2344.
[32]
Yasutaka Ihara. 1966. On discrete subgroups of the two by two projective linear group over p-adic fields. Journal of the Mathematical Society of Japan, 18, 3 (1966), 219–235.
[33]
Nabil Kahale. 1995. Eigenvalues and expansion of regular graphs. Journal of the ACM (JACM), 42, 5 (1995), 1091–1106.
[34]
Amitay Kamber and Tali Kaufman. 2022. Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. 426–435.
[35]
Zohar S Karnin. 2011. Deterministic construction of a high dimensional ℓ _p section in ℓ _1^n for any p < 2. In Proceedings of the forty-third annual ACM symposium on Theory of computing. 645–654.
[36]
A Yu Kitaev. 2003. Fault-tolerant quantum computation by anyons. Annals of physics, 303, 1 (2003), 2–30.
[37]
Swastik Kopparty, Noga Ron-Zewi, and Shubhangi Saraf. 2023. Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. arXiv preprint arXiv:2310.19149.
[38]
Anthony Leverrier and Gilles Zémor. 2022. Quantum tanner codes. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). 872–883.
[39]
Anthony Leverrier and Gilles Zémor. 2023. Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1216–1244.
[40]
Ting-Chun Lin and Min-Hsiu Hsieh. 2022. Good quantum LDPC codes with linear time decoder from lossless expanders. arXiv:2203.03581.
[41]
Alexander Lubotzky, Ralph Phillips, and Peter Sarnak. 1988. Ramanujan graphs. Combinatorica, 8 (1988), 261–277.
[42]
Grigorii A. Margulis. 1988. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii, 24, 1 (1988), 51–60.
[43]
Theo McKenzie and Sidhanth Mohanty. 2021. High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021).
[44]
Sidhanth Mohanty, Ryan O’Donnell, and Pedro Paredes. 2020. Explicit near-Ramanujan graphs of every degree. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. 510–523.
[45]
Moshe Morgenstern. 1994. Existence and explicit constructions of q+ 1 regular Ramanujan graphs for every prime power q. Journal of Combinatorial Theory, Series B, 62, 1 (1994), 44–62.
[46]
Ryan O’Donnell and Xinyu Wu. 2020. Explicit near-fully X-Ramanujan graphs. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). 1045–1056.
[47]
Pavel Panteleev and Gleb Kalachev. 2022. Asymptotically good quantum and locally testable classical LDPC codes. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. 375–388.
[48]
Omer Reingold, Salil Vadhan, and Avi Wigderson. 2000. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In Proceedings 41st Annual Symposium on Foundations of Computer Science. 3–13.
[49]
Grant Schoenebeck. 2008. Linear level Lasserre lower bounds for certain k-CSPs. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. 593–602.
[50]
Michael Sipser and Daniel Spielman. 1996. Expander Codes. IEEE Trans. Inform. Theory, 42, 6, part 1 (1996), 1710–1722.
[51]
Amnon Ta-Shma, Christopher Umans, and David Zuckerman. 2007. Lossless condensers, unbalanced expanders, and extractors. Combinatorica, 27 (2007), 213–240.
[52]
R Tanner. 1981. A recursive approach to low complexity codes. IEEE Transactions on information theory, 27, 5 (1981), 533–547.
Index Terms
- Explicit Two-Sided Unique-Neighbor Expanders
Recommendations
Explicit Unique-Neighbor Expanders
FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer ScienceWe present a simple, explicit construction of an infinite family F of bounded-degree 'unique-neighbor' expanders \Gamma; i.e., there are strictly positive constants \alpha and, such that all \Gamma = (X,E(\Gamma)) \varepsilon F satisfy the following ...
Explicit construction of q+1 regular local Ramanujan graphs, for all prime-powers q
AbstractA constant locality function is one in which each output bit depends on just a constant number of input bits. Viola and Wigderson (2018) gave an explicit construction of bipartite degree-3 Ramanujan graphs such that each neighbor of a vertex can be ...
Explicit Expanding Expanders
Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite families of expanders. In some applications, though, an infinite family is not ...
Comments
Information & Contributors
Information
Published In
June 2024
2049 pages
ISBN:9798400703836
DOI:10.1145/3618260
- General Chairs:
- Bojan Mohar,
- Igor Shinkar,
- Program Chair:
- Ryan O'Donnell
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NSF CAREER
- NSF GRFP Grant
- NSF Grant
Conference
STOC '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
Upcoming Conference
STOC '25
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 210Total Downloads
- Downloads (Last 12 months)210
- Downloads (Last 6 weeks)28
Reflects downloads up to 09 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in