arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.03479math.PRcs.DMmath.CO

加权随机 $d$-正则图的极值谱行为

Extremal spectral behavior of weighted random $d$-regular graphs

Jaehun Lee, Kyeongsik Nam

AI总结:

本文研究带随机边权重的随机 $d$-正则图,刻画极值谱随边权尾部的相变,并证明极值特征向量局部化。

摘要:

分析其元素之间存在依赖性的随机矩阵的谱行为是一个具有挑战性的问题。随机 $d$-正则图的邻接矩阵就是一个引人关注的突出例子,并已引起巨大兴趣。一个关键的谱可观测量是极值特征值,它揭示了图的有用几何性质。根据 Alon 猜想(该猜想已由 Friedman 验证),随机 $d$-正则图的(非平凡)极值特征值约为 $2\sqrt{d-1}$。在本文中,我们分析了赋予随机边权重的随机 $d$-正则图(其中 $d\ge 3$ 固定)的极值谱,并精确描述了其关于边权重尾部的相变行为。此外,我们证明极值特征向量始终是局部化的,这与所有特征向量均为非局部化的无权情形形成鲜明对比。我们的方法具有稳健性,其灵感来自在 Erdős-Rényi 图背景下发展的一种稀疏化技术(Ganguly 和 Nam,2022年),该技术也可用于分析元素相互依赖的一般随机矩阵的谱。

英文摘要:

Analyzing the spectral behavior of random matrices with dependency among entries is a challenging problem. The adjacency matrix of the random $d$-regular graph is a prominent example that has attracted immense interest. A crucial spectral observable is the extremal eigenvalue, which reveals useful geometric properties of the graph. According to the Alon's conjecture, which was verified by Friedman, the (nontrivial) extremal eigenvalue of the random $d$-regular graph is approximately $2\sqrt{d-1}$. In the present paper, we analyze the extremal spectrum of the random $d$-regular graph (with $d\ge 3$ fixed) equipped with random edge-weights, and precisely describe its phase transition behavior with respect to the tail of edge-weights. In addition, we establish that the extremal eigenvector is always localized, showing a sharp contrast to the unweighted case where all eigenvectors are delocalized. Our method is robust and inspired by a sparsification technique developed in the context of Erdős-Rényi graphs (Ganguly and Nam, '22), which can also be applied to analyze the spectrum of general random matrices whose entries are dependent.

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

↑