arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.01962math.SP
收藏

关于量子图的谱隙

On the Spectral Gap of a Quantum Graph

James B. Kennedy, Pavel Kurasov, Gabriela Malenova, Delio Mugnolo

摘要:

我们考虑的问题,找到普遍的边界上的Laplacian的谱间隙的度量图的自然边界条件在顶点上的“等周”或“等直径”类型的界限,在各种分析和组合性质的图形:它的总长度,直径,顶点数和边缘数。我们调查的参数组合是必要的,以获得非平凡的上限和下界,并获得了一些尖锐的估计,这些参数。我们还表明,在一个组合图上的拉普拉斯矩阵相比,没有绑定只依赖于直径是可能的。作为一个特殊的情况下,我们的结果度量图,我们推导出的归一化拉普拉斯矩阵的组合图,令人惊讶的是,有时比纯粹的组合方法在图论文献中得到的更尖锐的估计。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑