Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues

2018/12/06 by Miller, Gary L., Walkington, Noel J., Wang, Alex L.
#Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1812.02841

Abstract

We present two graph quantities Psi(G,S) and Psi₂(G) which give constant factor estimates to the Dirichlet and Neumann eigenvalues, lambda(G,S) and lambda₂(G), respectively. Our techniques make use of a discrete Hardy-type inequality.

Related

• Comparisons of Dirichlet, Neumann and Laplacian eigenvalues on graphs and their applications
• Bounds on graph eigenvalues I
• Upper bound for the Laplacian eigenvalues of a graph
• Eigenvalue bounds for the signless p-Laplacian
• An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs