arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1111.2080math.PRmath.COmath.GR
收藏

可测Kesten定理

The measurable Kesten theorem

Miklos Abert, Yair Glasner, Balint Virag

摘要:

给出了有限d-正则图的短圈密度与谱半径之间的显式估计。这使得我们能够证明有限d-正则Ramanujan图G的本质围长至少是c log log |G|。我们证明了无限d-正则Ramanujan幺模随机图是树。利用Benjamini-Schramm收敛性,得到了一个刚性结果:如果d-正则有限图G的大多数特征值落在Alon-Boppana区域,则G的特征值分布接近d-正则树的谱测度. Kesten证明了如果一个Cayley图的谱半径与它的泛覆盖相同,那么它一定是一棵树。我们将其推广到单模随机图。

英文摘要:

We give explicit estimates between the spectral radius and the densities of short cycles for finite d-regular graphs. This allows us to show that the essential girth of a finite d-regular Ramanujan graph G is at least c log log |G|. We prove that infinite d-regular Ramanujan unimodular random graphs are trees. Using Benjamini-Schramm convergence this leads to a rigidity result saying that if most eigenvalues of a d-regular finite graph G fall in the Alon-Boppana region, then the eigenvalue distribution of G is close to the spectral measure of the d-regular tree. Kesten showed that if a Cayley graph has the same spectral radius as its universal cover, then it must be a tree. We generalize this to unimodular random graphs.

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

↑