This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of ele
Elementary Number Theory, Group Theory, and Ramanujan Graphs [Lecture notes]
โ Scribed by Giuliana Davidoff, Peter Sarnak, Alain Valette
- Year
- 2000
- Tongue
- English
- Leaves
- 163
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of ele
This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of ele