Graphs versus Manifolds in Eigenvalues and Distances Between Subsets
This talk presents a method to translate results concerning graph Laplacians to analogous theorems for Riemannian manifold Laplacians. It specifically demonstrates an improved upper bound for the first Laplacian eigenvalue on Riemannian manifolds, derived from graph theoretic bounds on subset distances and volumes.