Lower estimates on eigenvalues of quantum graphs

DOI10.7153/OAM-2020-14-47zbMATH Open1460.34036OpenAlexW3089472445MaRDI QIDQ3389285FDOQ3389285

Authors: Delio Mugnolo, M. Plümer 

Publication date: 10 May 2021

Published in: Operators and Matrices (Search for Journal in Brave)

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.

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

Recommendations

• On the spectral gap of a quantum graph
• Quantum graphs which optimize the spectral gap
• Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
• Spectral gap for complete graphs: upper and lower estimates
• Spectral estimates for infinite quantum graphs

zbMATH Keywords

planar graphsdouble cover conjecturenormalized Laplaciansspectral geometry of quantum graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Estimates of eigenvalues in context of PDEs (35P15) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)

• Title not available (Why is that?)
• Quantum trees which maximize higher eigenvalues are unbalanced
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
• A transfer principle and applications to eigenvalue estimates for graphs
• Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs

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)