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

通过圈数给出多路Cheeger常数的谱界

Spectral bounds of multi-way Cheeger constants via cyclomatic number

Chuanyuan Ge

AI总结:

本文通过圈数移动特征值指标,为多路Cheeger常数建立了绝对常数上界和谱半径下界,并提供了树高阶Cheeger不等式的直接证明。

摘要:

作为著名Cheeger不等式的非平凡推广,Lee、Oveis Gharan和Trevisan提出的图的高阶Cheeger不等式为每个$k$提供了$k$-way Cheeger常数的一个上界,形式为$C(k)\sqrt{λ_k(G)}$,其中$λ_k(G)$是图Laplacian的第$k$个特征值,$C(k)$是仅依赖于$k$的常数。在本文中,我们证明了一些多路Cheeger常数的新界。通过利用圈数移动特征值的指标,我们建立了一个用绝对常数代替$C(k)$的上界估计。特别地,这为Miclo在树上的高阶Cheeger不等式提供了一个更直接的证明。我们还给出了一个以图的谱半径表示的多路Cheeger常数的新下界。证明涉及离散节点域的概念,以及一个展示特征函数一般性质的概率论证。

英文摘要:

As a non-trivial extension of the celebrated Cheeger inequality, the higher-order Cheeger inequalities for graphs due to Lee, Oveis Gharan and Trevisan provide for each $k$ an upper bound for the $k$-way Cheeger constant in forms of $C(k)\sqrt{λ_k(G)}$, where $λ_k(G)$ is the $k$-th eigenvalue of the graph Laplacian and $C(k)$ is a constant depending only on $k$. In this article, we prove some new bounds for multi-way Cheeger constants. By shifting the index of the eigenvalue via cyclomatic number, we establish upper bound estimates with an absolute constant instead of $C(k)$. This, in particular, gives a more direct proof of Miclo's higher order Cheeger inequalities on trees. We also show a new lower bound of the multi-way Cheeger constants in terms of the spectral radius of the graph. The proofs involve the concept of discrete nodal domains and a probability argument showing generic properties of eigenfunctions.

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

↑