Answers are grounded in this paper and cite their sources.
We examine diagonal combs, a recently identified class of infinite metric graphs whose properties depend on one parameter. These graphs exhibit a fascinating regime where they possess infinite volume while maintaining purely discrete spectrum for the Neumann Laplacian. In this regime, we establish polynomial upper and lower bounds on the k-th eigenvalue, revealing that the eigenvalues grow at a rate strictly slower than quadratic. However, once the diagonal combs transition to finite volume, their growth accelerates to a quadratic rate. Our methodology involves employing spectral geometric principles tailored for metric graphs, complemented by deriving estimates for the k-th eigenvalue on compact metric graphs.
No takes yet. Share an insight, caveat, or question.
Kennedy et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: