Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
From MaRDI portal
Publication:5027193
DOI10.1090/proc/15866OpenAlexW3095425088MaRDI QIDQ5027193
Publication date: 4 February 2022
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.13969
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Discrete version of topics in analysis (39A12)
Related Items (4)
A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity ⋮ Upper bounds for the Steklov eigenvalues on trees ⋮ Dirichlet-to-Neumann maps for differential forms on graphs and their eigenvalues ⋮ Monotonicity of Steklov eigenvalues on graphs and applications
Cites Work
- Unnamed Item
- Spectra of graphs
- Ricci curvature of graphs
- An isoperimetric inequality and the first Steklov eigenvalue
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Minimum higher eigenvalues of Laplacians on graphs
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Ollivier Ricci curvature for general graph Laplacians: heat equation, Laplacian comparison, non-explosion and diameter bounds
- Discrete Curvature and Abelian Groups
- Curvature aspects of graphs
- The Legacy of Vladimir Andreevich Steklov
- Higher order Cheeger inequalities for Steklov eigenvalues
This page was built for publication: Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs