About this Title
Joel Friedman, Editor
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year: 1993; Volume 10
ISBNs: 978-0-8218-6602-3 (print); 978-1-4704-3968-2 (online)
MathSciNet review: MR1235562
MSC: Primary 05-06
This volume contains the proceedings of the DIMACS Workshop on Expander Graphs, held at Princeton University in May 1992. The subject of expanding graphs involves a number of different fields and gives rise to important connections among them. Many of these fields were represented at the workshop, including theoretical computer science, combinatorics, probability theory, representation theory, number theory, and differential geometry. With twenty-two talks and two open problem sessions, the workshop provided a unique opportunity for cross-fertilization of various areas. This volume will prove useful to mathematicians and computer scientists interested in current results in this area of research.
Research mathematicians and computer scientists.
Table of Contents
- Random Cayley graphs and expanders (abstract)
- Spectral geometry and the Cheeger constant
- The Laplacian of a hypergraph
- Uniform sampling modulo a group of symmetries using Markov chain simulation
- On the second eigenvalue and linear expansion of regular graphs
- Numerical investigation of the spectrum for certain families of Cayley graphs
- Some algebraic constructions of dense graphs of large girth and of large size
- Groups and expanders
- Ramanujan graphs and diagrams function field approach
- Highly expanding graphs obtained from dihedral groups
- Are finite upper half plane graphs Ramanujan?