Expander graphs in pure and applied mathematics

Alexander Lubotzky*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

123 Scopus citations

Abstract

Expander graphs are highly connected sparse finite graphs. They play an important role in computer science as basic building blocks for network constructions, error correcting codes, algorithms, and more. In recent years they have started to play an increasing role also in pure mathematics: number theory, group theory, geometry, and more. This expository article describes their constructions and various applications in pure and applied mathematics.

Original languageEnglish
Pages (from-to)113-162
Number of pages50
JournalBulletin of the American Mathematical Society
Volume49
Issue number1
DOIs
StatePublished - 2012

Fingerprint

Dive into the research topics of 'Expander graphs in pure and applied mathematics'. Together they form a unique fingerprint.

Cite this