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

稠密随机几何图的谱

On the Spectrum of Dense Random Geometric Graphs

Kartick Adhikari, Robert J. Adler, Omer Bobrowski, Ron Rosenthal

摘要:

本文研究了随机几何图$G(n,r)$的谱,在此图是稠密的和高度连通的。在\erdren $G(n,p)$随机图中,众所周知,在连通性上,归一化图拉普拉斯算子的谱集中在$1$周围。我们表明,这样的浓度不会发生在$G(n,r)$的情况下,即使当图是密集的,几乎是一个完全图。特别是,我们表明,限制光谱间隙严格小于$1$。在顶点均匀分布在单位立方体和$r=1$中的特殊情况下,我们证明了对于每个$0\le k \le d$,在$1-2^{-k}$附近至少存在$\binom{d}{k}$本征值,并且极限谱隙正好是$1/2$ .我们还表明,在这种情况下,相应的本征函数是密切相关的几何配置的点。

英文摘要:

In this paper we study the spectrum of the random geometric graph $G(n,r)$, in a regime where the graph is dense and highly connected. In the \erdren $G(n,p)$ random graph it is well known that upon connectivity the spectrum of the normalized graph Laplacian is concentrated around $1$. We show that such concentration does not occur in the $G(n,r)$ case, even when the graph is dense and almost a complete graph. In particular, we show that the limiting spectral gap is strictly smaller than $1$. In the special case where the vertices are distributed uniformly in the unit cube and $r=1$, we show that for every $0\le k \le d$ there are at least $\binom{d}{k}$ eigenvalues near $1-2^{-k}$, and the limiting spectral gap is exactly $1/2$. We also show that the corresponding eigenfunctions in this case are tightly related to the geometric configuration of the points.

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

↑