| Softcover ISBN: | 978-0-8218-0315-8 |
| Product Code: | CBMS/92 |
| List Price: | $39.00 |
| Individual Price: | $31.20 |
| eBook ISBN: | 978-1-4704-2452-7 |
| Product Code: | CBMS/92.E |
| List Price: | $36.00 |
| Individual Price: | $28.80 |
| Softcover ISBN: | 978-0-8218-0315-8 |
| eBook: ISBN: | 978-1-4704-2452-7 |
| Product Code: | CBMS/92.B |
| List Price: | $75.00 $57.00 |
| Softcover ISBN: | 978-0-8218-0315-8 |
| Product Code: | CBMS/92 |
| List Price: | $39.00 |
| Individual Price: | $31.20 |
| eBook ISBN: | 978-1-4704-2452-7 |
| Product Code: | CBMS/92.E |
| List Price: | $36.00 |
| Individual Price: | $28.80 |
| Softcover ISBN: | 978-0-8218-0315-8 |
| eBook ISBN: | 978-1-4704-2452-7 |
| Product Code: | CBMS/92.B |
| List Price: | $75.00 $57.00 |
-
Book DetailsCBMS Regional Conference Series in MathematicsVolume: 92; 1997; 212 ppMSC: Primary 05
Beautifully written and elegantly presented, this book is based on 10 lectures given at the CBMS workshop on spectral graph theory in June 1994 at Fresno State University. Chung's well-written exposition can be likened to a conversation with a good teacher—one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. The monograph is accessible to the nonexpert who is interested in reading about this evolving area of mathematics.
ReadershipGraduate students and research mathematicians interested in graph theory and its relations to combinatorics, geometry, communication theory, computer science, algebra, and other areas of pure and applied mathematics.
-
Table of Contents
-
Chapters
-
1. Eigenvalues and the Laplacian of a graph (Chapter 1)
-
2. Isoperimetric problems (Chapter 2)
-
3. Diameters and eigenvalues (Chapter 3)
-
4. Paths, flows, and routing (Chapter 4)
-
5. Eigenvalues and quasi-randomness (Chapter 5)
-
6. Expanders and explicit constructions (Chapter 6)
-
7. Eigenvalues of symmetrical graphs (Chapter 7)
-
8. Eigenvalues of subgraphs with boundary conditions (Chapter 8)
-
9. Harnack inequalities (Chapter 9)
-
10. Heat kernels (Chapter 10)
-
11. Sobolev inequalities (Chapter 11)
-
12. Advanced techniques for random walks on graphs (Chapter 12)
-
-
Additional Material
-
Reviews
-
The book presents a very complete picture of how various properties of a graph—from Cheeger constants and diameters to more recent developments such as log-Sobolev constants and Harnack inequalities—are related to the spectrum.
Even though the point of view of the book is quite geometric, the methods and exposition are purely graph-theoretic. As a result, the book is quite accessible to a reader who does not have any background in geometry.
As the author writes, ‘the underlying mathematics of spectral graph theory through all its connections to the pure and applied, the continuous and discrete, can be viewed as a single unified subject.’
Anyone who finds this sentence appealing is encouraged to give this book a try. He or she will not be disappointed.
Mathematical Reviews -
Incorporates a great deal of recent work, much of it due to the author herself ... clear, without being pedantic, and challenging, without being obscure.
Bulletin of the London Mathematical Society
-
-
RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
Beautifully written and elegantly presented, this book is based on 10 lectures given at the CBMS workshop on spectral graph theory in June 1994 at Fresno State University. Chung's well-written exposition can be likened to a conversation with a good teacher—one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. The monograph is accessible to the nonexpert who is interested in reading about this evolving area of mathematics.
Graduate students and research mathematicians interested in graph theory and its relations to combinatorics, geometry, communication theory, computer science, algebra, and other areas of pure and applied mathematics.
-
Chapters
-
1. Eigenvalues and the Laplacian of a graph (Chapter 1)
-
2. Isoperimetric problems (Chapter 2)
-
3. Diameters and eigenvalues (Chapter 3)
-
4. Paths, flows, and routing (Chapter 4)
-
5. Eigenvalues and quasi-randomness (Chapter 5)
-
6. Expanders and explicit constructions (Chapter 6)
-
7. Eigenvalues of symmetrical graphs (Chapter 7)
-
8. Eigenvalues of subgraphs with boundary conditions (Chapter 8)
-
9. Harnack inequalities (Chapter 9)
-
10. Heat kernels (Chapter 10)
-
11. Sobolev inequalities (Chapter 11)
-
12. Advanced techniques for random walks on graphs (Chapter 12)
-
The book presents a very complete picture of how various properties of a graph—from Cheeger constants and diameters to more recent developments such as log-Sobolev constants and Harnack inequalities—are related to the spectrum.
Even though the point of view of the book is quite geometric, the methods and exposition are purely graph-theoretic. As a result, the book is quite accessible to a reader who does not have any background in geometry.
As the author writes, ‘the underlying mathematics of spectral graph theory through all its connections to the pure and applied, the continuous and discrete, can be viewed as a single unified subject.’
Anyone who finds this sentence appealing is encouraged to give this book a try. He or she will not be disappointed.
Mathematical Reviews -
Incorporates a great deal of recent work, much of it due to the author herself ... clear, without being pedantic, and challenging, without being obscure.
Bulletin of the London Mathematical Society
