On the spectral gap of a quantum graph

From MaRDI portal
Publication:312228

DOI10.1007/S00023-016-0460-2zbMATH Open1354.34057arXiv1504.01962OpenAlexW1694810065MaRDI QIDQ312228FDOQ312228

Pavel Kurasov, James Bernard Kennedy, Delio Mugnolo, Gabriela Malenová

Publication date: 14 September 2016

Published in: Annales Henri Poincaré (Search for Journal in Brave)

Abstract: We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and combinatorial properties of the graph: its total length, diameter, number of vertices and number of edges. We investigate which combinations of parameters are necessary to obtain non-trivial upper and lower bounds and obtain a number of sharp estimates in terms of these parameters. We also show that, in contrast to the Laplacian matrix on a combinatorial graph, no bound depending only on the diameter is possible. As a special case of our results on metric graphs, we deduce estimates for the normalised Laplacian matrix on combinatorial graphs which, surprisingly, are sometimes sharper than the ones obtained by purely combinatorial methods in the graph theoretical literature.


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





Cites Work


Cited In (52)






This page was built for publication: On the spectral gap of a quantum graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312228)