Eigenvalue Interlacing of Bipartite Graphs and Construction of Expander Code using Vertex-split of a Bipartite Graph

TL;DR

This paper studies eigenvalue interlacing in bipartite graphs, introduces a vertex-split method to construct expander codes with desirable properties, and proves conditions for connectivity and expansion in these graphs.

Contribution

It introduces a novel vertex-split technique for bipartite graphs to construct asymptotically good expander codes with specific expansion factors.

Findings

Eigenvalue interlacing bounds for bipartite graphs.

Vertex-split method produces bipartite expanders.

Constructed expander codes are asymptotically good.

Abstract

The second largest eigenvalue of a graph is an important algebraic parameter which is related with the expansion, connectivity and randomness properties of a graph. Expanders are highly connected sparse graphs. In coding theory, Expander codes are Error Correcting codes made up of bipartite expander graphs. In this paper, first we prove the interlacing of the eigenvalues of the adjacency matrix of the bipartite graph with the eigenvalues of the bipartite quotient matrices of the corresponding graph matrices. Then we obtain bounds for the second largest and second smallest eigenvalues. Since the graph is bipartite, the results for Laplacian will also hold for Signless Laplacian matrix. We then introduce a new method called vertex-split of a bipartite graph to construct asymptotically good expander codes with expansion factor $\frac{D}{2}<\alpha < D$ and $\epsilon<\frac{1}{2}$ and prove a condition for the vertex-split of a bipartite graph to be $k-$connected with respect to $\lambda_{2}.$ Further, we prove that the vertex-split of $G$ is a bipartite expander. Finally, we construct an asymptotically good expander code whose factor graph is a graph obtained by the vertex-split of a bipartite graph.