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