Expanders obtained from affine transformations (Q1098859): Difference between revisions

A bipartite graph \(G=(U,V,E)\) is an (n,k,\(\delta\),\(\alpha)\) expander if \(| U| =| V| =n\), \(| E| \leq kn\), and for any \(X\subseteq U\) with \(| X| \leq \alpha n\), \(| \Gamma_ G(X)| \geq (1+\delta (1-| X| /n))| X|\), where \(\Gamma_ G(X)\) is the set of nodes in V connected to nodes in X with edges in E. We show, using relatively elementary analysis in linear algebra, that the problem of estimating the coefficient \(\delta\) of a bipartite graph is reduced to that of estimating the second largest eigenvalue of a matrix related to the graph. In particular, we consider the case where the bipartite graphs are defined from affine transformations, and obtain some general results on estimating the eigenvalues of the matrix by using the discrete Fourier transform. These results are then used to estimate the expanding coefficients of bipartite graphs obtained from two dimensional affine transformations and those obtained from one-dimensional ones.