A linear Cheeger inequality using eigenvector norms
From MaRDI portal
Abstract: The Cheeger constant, , is a measure of expansion within a graph. The classical Cheeger Inequality states: where is the first nontrivial eigenvalue of the normalized Laplacian matrix. Hence, is tightly controlled by to within a quadratic factor. We give an alternative Cheeger Inequality where we consider the -norm of the corresponding eigenvector in addition to . This inequality controls to within a linear factor of thereby providing an improvement to the previous quadratic bounds. An additional advantage of our result is that while the original Cheeger constant makes it clear that as , our result shows that as .
Recommendations
- scientific article; zbMATH DE number 878889
- The first two largest eigenvalues of Laplacian, spectral gap problem and Cheeger constant of graphs
- scientific article; zbMATH DE number 475374
- Higher Dimensional Cheeger Inequalities
- Cheeger‐like inequalities for the largest eigenvalue of the graph Laplace operator
This page was built for publication: A linear Cheeger inequality using eigenvector norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746827)