arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04718math.PRmath.CO
收藏

随机对称矩阵的奇异性--改进界的组合方法

Singularity of random symmetric matrices -- a combinatorial approach to improved bounds

Asaf Ferber, Vishesh Jain

摘要:

令$M_n$表示随机对称$n \times n$矩阵,其上对角项是独立且相同分布的伯努利随机变量(其分别以概率$1/2$取值$1$和$-1$)。普遍认为$M_n$是奇异的,概率至多为$(2+o(1))^{-n}$。另一方面,由于Vershynin(2011),$M_n$的奇异概率的最著名的上限是$2^{-n^c}$,对于一些未指定的小常数$c > 0$。这改进了Costello,Tao和Vu(2005)的多项式奇点界,以及Nguyen(2011)的界,表明奇点概率比任何多项式衰减得更快。本文改进了已有的结果,证明了对所有充分大的$n$,$M_n$的奇异概率至多为$2^{-n^{1/4}\sqrt{\log{n}}/1000}$.证明利用并扩展了一种新的组合方法离散随机矩阵理论,这是最近推出的作者与Luh和Samotij。

英文摘要:

Let $M_n$ denote a random symmetric $n \times n$ matrix whose upper diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely conjectured that $M_n$ is singular with probability at most $(2+o(1))^{-n}$. On the other hand, the best known upper bound on the singularity probability of $M_n$, due to Vershynin (2011), is $2^{-n^c}$, for some unspecified small constant $c > 0$. This improves on a polynomial singularity bound due to Costello, Tao, and Vu (2005), and a bound of Nguyen (2011) showing that the singularity probability decays faster than any polynomial. In this paper, improving on all previous results, we show that the probability of singularity of $M_n$ is at most $2^{-n^{1/4}\sqrt{\log{n}}/1000}$ for all sufficiently large $n$. The proof utilizes and extends a novel combinatorial approach to discrete random matrix theory, which has been recently introduced by the authors together with Luh and Samotij.

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

↑