Monotonicity of Steklov eigenvalues on graphs and applications
From MaRDI portal
Publication:6203745
DOI10.1007/s00526-024-02683-yarXiv2112.12885MaRDI QIDQ6203745
Publication date: 8 April 2024
Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.12885
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Discrete version of topics in analysis (39A12)
Cites Work
- The first Steklov eigenvalue, conformal geometry, and minimal surfaces
- Spectra of graphs
- The Yamabe problem on manifolds with boundary
- Some geometric aspects of graphs and their eigenfunctions
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- Upper bounds for the Steklov eigenvalues on trees
- The Steklov spectrum and coarse discretizations of manifolds with boundary
- The spectral gap of graphs and Steklov eigenvalues on surfaces
- Random Walks and Heat Kernels on Graphs
- The Legacy of Vladimir Andreevich Steklov
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
- Higher order Cheeger inequalities for Steklov eigenvalues
- Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs
- Steklov eigenvalue problem on subgraphs of integer lattices