TY - GEN

T1 - Eigenvalues, expanders and superconcentrators

AU - Alon, Noga

AU - Milman, V. D.

N1 - Publisher Copyright:
© 1984 IEEE.

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85115274085&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85115274085

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 320

EP - 322

BT - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984

PB - IEEE Computer Society

T2 - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984

Y2 - 24 October 1984 through 26 October 1984

ER -