Monotonicity of Steklov eigenvalues on graphs and applications
From MaRDI portal
Publication:6203745
Abstract: In this paper, we obtain monotonicity of Steklov eigenvalues on graphs which as a special case on trees extends the results of He-Hua [Calc. Var. Partial Differential Equations 61 (2022), no. 3, Paper No. 101, arXiv: 2103.07696] to higher Steklov eigenvalues and gives affirmative answers to two problems proposed in He-Hua [arXiv: 2103.07696]. As applications of the monotonicity of Steklov eigenvalues, we obtain some estimates for Steklov eigenvalues on trees generalizing the isodiametric estimate for the first positive Steklov eigenvalues on trees in He-Hua [arXiv:2011.11014].
Recommendations
- Upper bounds for the Steklov eigenvalues on trees
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Monotonie bei Stekloffschen Eigenwerten. (Monotonicity for Stekloff eigenvalues)
Cites work
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs
- Higher order Cheeger inequalities for Steklov eigenvalues
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Random walks and heat kernels on graphs
- Some geometric aspects of graphs and their eigenfunctions
- Spectra of graphs
- Steklov eigenvalue problem on subgraphs of integer lattices
- The Legacy of Vladimir Andreevich Steklov
- The Steklov spectrum and coarse discretizations of manifolds with boundary
- The Yamabe problem on manifolds with boundary
- The first Steklov eigenvalue, conformal geometry, and minimal surfaces
- The spectral gap of graphs and Steklov eigenvalues on surfaces
- Upper bounds for the Steklov eigenvalues on trees
This page was built for publication: Monotonicity of Steklov eigenvalues on graphs and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203745)