2023/06/13 by Golowich, Louis · 2 citations
#05C48 #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
paper · doi:10.48550/arxiv.2306.07551
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.