Expanders obtained from affine transformations
- 101 Downloads
A bipartite graphG=(U, V, E) is an (n, k, δ, α) expander if |U|=|V|=n, |E|≦kn, and for anyX⊆U with |X|≦αn, |ΓG(X)|≧(1+δ(1−|X|/n)) |X|, whereΓG(X) is the set of nodes inV connected to nodes inX with edges inE. We show, using relatively elementary analysis in linear algebra, that the problem of estimating the coefficientδ 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.
AMS subject classification (1980)68 A 20
Unable to display preview. Download preview PDF.
- N. Alon andV. D. Milman, Eigenvalues, expanders and superconcentrators,Proc. 25th Ann. IEEE Symp. on Found. of Comput. Sci., (1984), 320–322.Google Scholar
- N. Alon, Z. Galil andV. D. Milman, Better expanders and superconcentrators”, to appear inJ. of Algorithms.Google Scholar
- S. Jimbo andA. Maruoka, Expanders obtained from affine transformations,Proc. 17th Ann. ACM Symp. on Theory of Computing, (1985), 88–97.Google Scholar
- M. Klawe, Nonexistence of one-dimensional expanding graphs,Proc. 22nd Ann. Symp. on Found. of Comput. Sci., (1981), 109–113.Google Scholar