Spectral Graph Theory¶
Chung, F. R. K. Spectral Graph Theory.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cut
- Cheeger-type inequalities: the smallest non-trivial Laplacian eigenvalue bounds and is bounded by the isoperimetric cut, linking the spectral and combinatorial views of connectivity and explaining why spectral clustering works at all.
This sourceCBMS Regional Conference Series in Mathematics 92. Providence, RI: American Mathematical Society, 1997. Develops Cheeger-type inequalities linking the smallest nontrivial Laplacian eigenvalue to the isoperimetric (conductance) cut, and conductance bounds on random-walk mixing.
- Cheeger-type inequalities: the smallest non-trivial Laplacian eigenvalue bounds and is bounded by the isoperimetric cut, linking the spectral and combinatorial views of connectivity and explaining why spectral clustering works at all.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:a31f9f043169 · see in the full table