Abstract
Eigenvalues and the Laplacian of a graph Isoperimetric problems Diameters and eigenvalues Paths, flows, and routing Eigenvalues and quasi-randomness Expanders and explicit constructions Eigenvalues of symmetrical graphs Eigenvalues of subgraphs with boundary conditions Harnack inequalities Heat kernels Sobolev inequalities Advanced techniques for random walks on graphs Bibliography Index.
Keywords
Isoperimetric inequalityMathematicsEigenvalues and eigenvectorsSpectral graph theoryLaplacian matrixRandomnessLaplace operatorCombinatoricsPure mathematicsDiscrete mathematicsGraphMathematical analysisLine graphVoltage graphPhysics
Affiliated Institutions
Related Publications
On the Quality of Spectral Separators
Computing graph separators is an important step in many graph algorithms. A popular technique for finding separators involves spectral methods. However, there has not been much ...
Partitioning Sparse Matrices with Eigenvectors of Graphs
The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An ...
Numerical operator calculus in higher dimensions
When an algorithm in dimension one is extended to dimension d , in nearly every case its computational cost is taken to the power d . This fundamental difficulty is the single g...
Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
In this letter, we show a direct relation between spectral embedding methods and kernel principal components analysis and how both are special cases of a more general learning p...
Publication Info
- Year
- 1996
- Type
- book
- Citations
- 5721
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
5721
OpenAlex
Cite This
Fan Chung
(1996).
Spectral Graph Theory.
Regional conference series in mathematics
.
https://doi.org/10.1090/cbms/092
Identifiers
- DOI
- 10.1090/cbms/092