随机几何图的谱是集中的
The spectrum of a random geometric graph is concentrated
摘要:
考虑$n$点在$[0,1]^d$中均匀分布。如果两点之间的距离不大于$r(n)$,则通过连接两点来形成图形。这给出了一个随机几何图$\gnrn$,该图对于适当的$r(n)$是连通的。我们证明了在$\gnrn$上的简单随机游动(\abbr{srw})的转移阵的谱测度是集中的,并且实际上收敛于确定性网格上的图的谱测度。
英文摘要:
Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We show that the spectral measure of the transition matrix of the simple random walk (\abbr{srw}) on $\gnrn$ is concentrated, and in fact converges to that of the graph on the deterministic grid.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。