随机图的谱间隙及其应用
Spectral gaps of random graphs and applications
摘要:
通过连通度阈值研究了Erdens-Rényi随机图的谱隙.特别地,我们证明了对于任何固定的$δ> 0$,如果$$p \ge \frac{(1/2 + δ) \log n}{n},$$,则Erdens-Rényi图的规范化图Laplacian的所有非零特征值都紧紧地集中在$1$周围.我们估计的衰减率的频谱间隙$1$和故障概率,直到一个常数的因素。我们还表明,$1/2$在上述是最佳的,如果$p = \frac{c \log n}{n}$的$c < 1/2,$,然后有拉普拉斯算子的特征值限制的巨组件,从$1.$我们然后描述了几个应用程序,我们的谱隙结果随机拓扑和几何群论。这些都依赖于加兰的“p-adic曲率”方法,一种单纯复形的谱几何。这些都可以被认为是高维扩展属性。
英文摘要:
We study the spectral gap of the Erdős--Rényi random graph through the connectivity threshold. In particular, we show that for any fixed $δ> 0$ if $$p \ge \frac{(1/2 + δ) \log n}{n},$$ then the normalized graph Laplacian of an Erdős--Rényi graph has all of its nonzero eigenvalues tightly concentrated around $1$. We estimate both the decay rate of the spectral gap to $1$ and the failure probability, up to a constant factor. We also show that the $1/2$ in the above is optimal, and that if $p = \frac{c \log n}{n}$ for $c < 1/2,$ then there are eigenvalues of the Laplacian restricted to the giant component that are separated from $1.$ We then describe several applications of our spectral gap results to stochastic topology and geometric group theory. These all depend on Garland's "p-adic curvature" method, a kind of spectral geometry for simplicial complexes. These can all be considered to be high-dimensional expander properties.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。