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

转移原理及其在图的eigenvalue估计中的应用

A transfer principle and applications to eigenvalue estimates for graphs

Omid Amini, David Cohen-Steiner

摘要:

在本文中,我们证明了一个变体的伯格-布鲁克斯转移原理,结合最近的特征值界的表面,允许获得上界的特征值的图作为其属的函数。更精确地说,我们证明了存在一个普适常数$C$,使得在$n$顶点上的(几何)亏格为$g$的图$G$的归一化拉普拉斯算子的第$k$个特征值$λ_k^{nr}$满足$$λ_k^{nr}(G) \leq C \frac{d_{\max}(g+k)}{n},$$,其中$d_{\max}$表示图顶点的最大价.这一结果与常数$C$的值的变化紧密相关,改进了Kelner,Lee,Price和Teng关于有界亏格图的结果.为了证明转移定理可能是独立的,我们将度量图上的拉普拉斯算子的特征值与其简单图模型的特征值联系起来,并讨论了网格划分问题的应用,将Miller-Teng-Thurston-Vavasis和Spielman-Tang的开创性结果扩展到任意网格。

英文摘要:

In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely, we show the existence of a universal constants $C$ such that the $k$-th eigenvalue $λ_k^{nr}$ of the normalized Laplacian of a graph $G$ of (geometric) genus $g$ on $n$ vertices satisfies $$λ_k^{nr}(G) \leq C \frac{d_{\max}(g+k)}{n},$$ where $d_{\max}$ denotes the maximum valence of vertices of the graph. This result is tight up to a change in the value of the constant $C$, and improves recent results of Kelner, Lee, Price and Teng on bounded genus graphs. To show that the transfer theorem might be of independent interest, we relate eigenvalues of the Laplacian on a metric graph to the eigenvalues of its simple graph models, and discuss an application to the mesh partitioning problem, extending pioneering results of Miller-Teng-Thurston-Vavasis and Spielman-Tang to arbitrary meshes.

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

↑