Universal lower bounds for Laplacians on weighted graphs
From MaRDI portal
Publication:3383256
Abstract: We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero eigenvalue in the finite volume case and the first eigenvalue of the Dirichlet Laplacian on subsets that satisfy natural geometric conditions.
Recommendations
- Lower bounds on the (Laplacian) spectral radius of weighted graphs
- Upper and lower bounds on the first non-zero eigenvalue of a weighted graph
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
- Weighted graph Laplacians and isoperimetric inequalities
Cited in
(9)- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- Geometry, dynamics and spectrum of operators on discrete spaces. Abstracts from the workshop held January 3--9, 2021 (online meeting)
- Poincaré inequalities on graphs
- An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
- Bounds on the first nonzero eigenvalue for self-adjoint boundary value problems on networks
- Upper and lower bounds on the first non-zero eigenvalue of a weighted graph
- Lower bounds for the minimum eigenvalue of the bi-Laplacian on a graph
- Lower bounds for the first eigenvalue of Laplacian on graphs
This page was built for publication: Universal lower bounds for Laplacians on weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3383256)
