This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
Explicit construction of families of linear expanders and superconcentrators is relevant to theoretical computer science in several ways. There is essentially only one known explicit construction. Here we show a correspondence between the eigenvalues of the adjacency matrix of a graph and its expansion properties, and combine it with results on Group Representations to obtain many new examples of families of linear expanders. We also obtain better expanders than those previously known and use them to construct explicitly n-superconcentrators with 157.4 n edges, much less than the previous most economical construction.
Citation:
N. Alon, V.D. Milman, "Eigenvalues, Expanders And Superconcentrators," focs, pp.320-322, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.