mlsanityData to 14 Oct 2026

Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues

arXiv 1812.02841 ↗First posted 6 Dec 2018cs.DM cs.DScited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 6 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.

  1. 2023Spectral Clustering on Large Datasets: When Does it Work? Theory from Continuous Clustering and Density Cheeger-Busercited by 0