A Linear Cheeger Inequality using Eigenvector Norms
Combinatorics
2014-12-11 v1 Discrete Mathematics
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 .
Cite
@article{arxiv.1412.3195,
title = {A Linear Cheeger Inequality using Eigenvector Norms},
author = {Franklin H. J. Kenter},
journal= {arXiv preprint arXiv:1412.3195},
year = {2014}
}
Comments
8 pages, 2 figures