Eigenvalues, Expanders and Superconcentrators

@inproceedings{Alon1984EigenvaluesEA,
  title={Eigenvalues, Expanders and Superconcentrators},
  author={Noga Alon and V. D. Milman and Murray Hill},
  year={1984}
}
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… CONTINUE READING

From This Paper

Topics from this paper.
28 Citations
15 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Sorting in clogn parallel steps

  • M Ajtai, J Komms, E Szemercdi
  • Combinatorica
  • 1983

Colloq. on Autom., Lang. and Prog

  • Colloq. on Autom., Lang. and Prog
  • 1982

Explicit construction of linear sized superconcentrators

  • Z Gaber, Galil
  • J. Comp. and Sys. Sci
  • 1981

Similar Papers

Loading similar papers…