The spectral gap of graphs and Steklov eigenvalues on surfaces
From MaRDI portal
Publication:2437981
Abstract: Using expander graphs, we construct a sequence of smooth compact surfaces with boundary of perimeter N, and with the first non-zero Steklov eigenvalue uniformly bounded away from zero. This answers a question which was raised in [9]. The genus grows linearly with N, this is the optimal growth rate.
Recommendations
- 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
- Upper bounds for Steklov eigenvalues on surfaces
- Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
Cited in
(9)- Tubular excision and Steklov eigenvalues
- The Steklov spectrum and coarse discretizations of manifolds with boundary
- Large Steklov eigenvalues on hyperbolic surfaces
- Some recent developments on the Steklov eigenvalue problem
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Large Steklov eigenvalues via homogenisation on manifolds
- Monotonicity of Steklov eigenvalues on graphs and applications
- Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach
- The Steklov problem on triangle-tiling graphs in the hyperbolic plane
This page was built for publication: The spectral gap of graphs and Steklov eigenvalues on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437981)