Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Expanding Graphs
 
Edited by: Joel Friedman
A co-publication of the AMS and DIMACS
Expanding Graphs
Hardcover ISBN:  978-0-8218-6602-3
Product Code:  DIMACS/10
List Price: $74.00
MAA Member Price: $66.60
AMS Member Price: $59.20
eBook ISBN:  978-1-4704-3968-2
Product Code:  DIMACS/10.E
List Price: $70.00
MAA Member Price: $63.00
AMS Member Price: $56.00
Hardcover ISBN:  978-0-8218-6602-3
eBook: ISBN:  978-1-4704-3968-2
Product Code:  DIMACS/10.B
List Price: $144.00 $109.00
MAA Member Price: $129.60 $98.10
AMS Member Price: $115.20 $87.20
Expanding Graphs
Click above image for expanded view
Expanding Graphs
Edited by: Joel Friedman
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-6602-3
Product Code:  DIMACS/10
List Price: $74.00
MAA Member Price: $66.60
AMS Member Price: $59.20
eBook ISBN:  978-1-4704-3968-2
Product Code:  DIMACS/10.E
List Price: $70.00
MAA Member Price: $63.00
AMS Member Price: $56.00
Hardcover ISBN:  978-0-8218-6602-3
eBook ISBN:  978-1-4704-3968-2
Product Code:  DIMACS/10.B
List Price: $144.00 $109.00
MAA Member Price: $129.60 $98.10
AMS Member Price: $115.20 $87.20
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 101993; 142 pp
    MSC: Primary 05; 60; 68

    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.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Research mathematicians and computer scientists.

  • Table of Contents
     
     
    • Chapters
    • 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?
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 101993; 142 pp
MSC: Primary 05; 60; 68

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.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Research mathematicians and computer scientists.

  • Chapters
  • 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?
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.