English

A Linear Cheeger Inequality using Eigenvector Norms

Combinatorics 2014-12-11 v1 Discrete Mathematics

Abstract

The Cheeger constant, hGh_G, is a measure of expansion within a graph. The classical Cheeger Inequality states: λ1/2hG2λ1\lambda_{1}/2 \le h_G \le \sqrt{2 \lambda_{1}} where λ1\lambda_1 is the first nontrivial eigenvalue of the normalized Laplacian matrix. Hence, hGh_G is tightly controlled by λ1\lambda_1 to within a quadratic factor. We give an alternative Cheeger Inequality where we consider the \infty-norm of the corresponding eigenvector in addition to λ1\lambda_1. This inequality controls hGh_G to within a linear factor of λ1\lambda_1 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 hG0h_G \to 0 as λ10\lambda_1 \to 0, our result shows that hG1/2h_G \to 1/2 as λ11\lambda_1 \to 1.

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

R2 v1 2026-06-22T07:26:03.909Z