Affiliation:
1. Weizmann Institute, Rehovot 76100, Israel
Abstract
We construct an infinite family of bounded-degree bipartite unique neighbour expander graphs with arbitrarily unbalanced sides. Although weaker than the lossless expanders constructed by Capalbo et al., our construction is simpler and may be closer to being implementable in practice, due to the smaller constants. We construct these graphs by composing bipartite Ramanujan graphs with a fixed-size gadget in a way that generalises the construction of unique neighbour expanders by Alon and Capalbo. For the analysis of our construction, we prove a strong upper bound on average degrees in small induced subgraphs of bipartite Ramanujan graphs. Our bound generalises Kahale’s average degree bound to bipartite Ramanujan graphs, and may be of independent interest. Surprisingly, our bound strongly relies on the exact Ramanujan-ness of the graph and is not known to hold for nearly-Ramanujan graphs.
Reference33 articles.
1. Alon, N., and Capalbo, M. (2002, January 19). Explicit unique-neighbor expanders. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada.
2. Capalbo, M., Reingold, O., Vadhan, S., and Wigderson, A. (2002, January 19–21). Randomness conductors and constant-degree expansion beyond the degree/2 barrier. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, QC, Canada.
3. Expander codes;Sipser;IEEE Trans. Inf. Theory,1996
4. Lin, T., and Hsieh, M. (July, January 26). c3-Locally Testable Codes from Lossless Expanders. Proceedings of the IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland.
5. Hsieh, J., McKenzie, T., Mohanty, S., and Paredes, P. (2023). Explicit two-sided unique-neighbor expanders. arXiv.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Explicit Two-Sided Unique-Neighbor Expanders;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10