Alon第二特征值猜想的证明及相关问题
A proof of Alon's second eigenvalue conjecture and related problems
摘要:
本文证明了Noga Alon的猜想。固定一个正整数d>2和实数n> 0;考虑一个n个顶点的随机d-正则图的邻接矩阵的第二特征值大于2 sqrt(d-1)+n的概率;然后当n趋于无穷大时,这个概率趋于零。本文证明了随机d-正则图的一些概念的猜想,包括d-奇的模型。我们还更精确地估计了上述概率,在许多情况和模型中(但不是所有),它像1/n的多项式一样衰减。
英文摘要:
In this paper we show the following conjecture of Noga Alon. Fix a positive integer d>2 and real epsilon > 0; consider the probability that a random d-regular graph on n vertices has the second eigenvalue of its adjacency matrix greater than 2 sqrt(d-1) + epsilon; then this probability goes to zero as n tends to infinity. We prove the conjecture for a number of notions of random d-regular graph, including models for d odd. We also estimate the aforementioned probability more precisely, showing in many cases and models (but not all) that it decays like a polynomial in 1/n.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。