# Lower Estimates on Eigenvalues of Quantum Graphs

## TL;DR

This paper develops a generalized transference principle to estimate eigenvalues of quantum graphs more accurately, providing sharper spectral bounds than traditional methods, with implications for understanding quantum graph spectra.

## Contribution

It introduces a more general transference principle and alternative applications, improving spectral estimates for quantum graphs beyond existing isoperimetric approaches.

## Key findings

- Spectral estimates on planar metric graphs are often sharper than previous bounds.
- The new method improves eigenvalue lower bounds for quantum graphs.
- Alternative applications of the transference principle enhance spectral analysis.

## 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.