The spectral gap of graphs and Steklov eigenvalues on surfaces

DOI10.3934/ERA.2014.21.19zbMATH Open1286.58020arXiv1310.2869OpenAlexW2069826634MaRDI QIDQ2437981FDOQ2437981

Authors: Bruno Colbois, Alexandre Girouard 

Publication date: 10 March 2014

Published in: Electronic Research Announcements in Mathematical Sciences (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1310.2869

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

zbMATH Keywords

expander graphsRiemannian surfaceSteklov problemeigenvalue inequalities

Mathematics Subject Classification ID

Estimates of eigenvalues in context of PDEs (35P15) Spectral problems; spectral geometry; scattering theory on manifolds (58J50)

Cited In (7)

• Tubular excision and Steklov eigenvalues
• Large Steklov eigenvalues on hyperbolic surfaces
• Some recent developments on the Steklov eigenvalue problem
• 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)