Lower estimates on eigenvalues of quantum graphs
From MaRDI portal
Publication:3389285
Abstract: A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous models of a graph. We elaborate on it by developing a more general transference principle and by proposing alternative ways of applying it. To illustrate our findings, we present several spectral estimates on planar metric graphs that are oftentimes sharper than those obtained by isoperimetric inequalities and further previously known methods.
Recommendations
Cites work
- scientific article; zbMATH DE number 3824599 (Why is no real title available?)
- scientific article; zbMATH DE number 3937197 (Why is no real title available?)
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- scientific article; zbMATH DE number 2052578 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A characteristic equation associated to an eigenvalue problem on \(c^ 2\)-networks
- A transfer principle and applications to eigenvalue estimates for graphs
- Analytic Inequalities
- Cheeger inequalities for unbounded graph Laplacians
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Extremal properties of eigenvalues for a metric graph.
- Introduction to quantum graphs
- On the spectral gap of a quantum graph
- Operators over regular maps
- Pucci eigenvalues on geodesic balls
- Quantum graphs which optimize the spectral gap
- Rayleigh estimates for differential operators on graphs
- Semigroup methods for evolution equations on networks
- Spectra of combinatorial Laplace operators on simplicial complexes
- Spectral estimates for infinite quantum graphs
- Surgery principles for the spectral analysis of quantum graphs
- Variational and semigroup methods for waves and diffusion in networks
Cited in
(6)- scientific article; zbMATH DE number 6943289 (Why is no real title available?)
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- A transfer principle and applications to eigenvalue estimates for graphs
- Quantum trees which maximize higher eigenvalues are unbalanced
This page was built for publication: Lower estimates on eigenvalues of quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389285)