Expander Graphs and their Applications
@article{Hoory2006ExpanderGA, title={Expander Graphs and their Applications}, author={S. Hoory and N. Linial}, journal={Bulletin of the American Mathematical Society}, year={2006}, volume={43}, pages={439-561} }
A major consideration we had in writing this survey was to make it accessible to mathematicians as well as to computer scientists, since expander graphs, the protagonists of our story, come up in numerous and often surprising contexts in both fields. But, perhaps, we should start with a few words about graphs in general. They are, of course, one of the prime objects of study in Discrete Mathematics. However, graphs are among the most ubiquitous models of both natural and human-made structures… CONTINUE READING
Figures from this paper
Paper Mentions
Blog Post
Blog Post
Blog Post
Blog Post
Blog Post
1,494 Citations
Approximate Moore Graphs are good expanders
- Mathematics, Computer Science
- J. Comb. Theory, Ser. B
- 2020
- 3
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 231 REFERENCES
Explicit Constructions of Linear-Sized Superconcentrators
- Computer Science
- J. Comput. Syst. Sci.
- 1981
- 418
- PDF
On the second eigenvalue of random regular graphs
- Mathematics, Computer Science
- 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
- 1987
- 204
Random Graph Coverings I: General Theory and Graph Connectivity
- Mathematics, Computer Science
- Comb.
- 2002
- 60
- PDF
Finite metric spaces: combinatorics, geometry and algorithms
- Mathematics, Computer Science
- SCG '02
- 2002
- 147
- PDF
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders
- Computer Science, Mathematics
- J. Comb. Theory, Ser. B
- 2000
- 21
- PDF
Semi-direct product in groups and zig-zag product in graphs: connections and applications
- Computer Science
- Proceedings 2001 IEEE International Conference on Cluster Computing
- 2001
- 74
- PDF