arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0804.1076math.SPmath-phmath.COmath.FAmath.MP
收藏

离散图和度量图的Eigenvalue包围法

Eigenvalue bracketing for discrete and metric graphs

Olaf Post, Fernando Lledo

摘要:

我们开发的拉普拉斯算子的特征值估计离散和度量图使用不同类型的边界条件在顶点的度量图。通过一个明确的对应关系的等边度量和离散图的频谱(也在“例外”的值的度量图对应的狄利克雷谱),我们进行这些估计从度量图拉普拉斯到离散的情况。我们将结果应用到覆盖图和目前的例子,覆盖图拉普拉斯算子有谱间隙。

英文摘要:

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph spectrum (also in the ``exceptional'' values of the metric graph corresponding to the Dirichlet spectrum) we carry over these estimates from the metric graph Laplacian to the discrete case. We apply the results to covering graphs and present examples where the covering graph Laplacians have spectral gaps.

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

↑