Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
Discrete Mathematics
2018-12-10 v1 Data Structures and Algorithms
Abstract
We present two graph quantities Psi(G,S) and Psi_2(G) which give constant factor estimates to the Dirichlet and Neumann eigenvalues, lambda(G,S) and lambda_2(G), respectively. Our techniques make use of a discrete Hardy-type inequality.
Cite
@article{arxiv.1812.02841,
title = {Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues},
author = {Gary L. Miller and Noel J. Walkington and Alex L. Wang},
journal= {arXiv preprint arXiv:1812.02841},
year = {2018}
}