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

稠密随机正则有向图的最小奇异值

The smallest singular value of dense random regular digraphs

Vishesh Jain, Ashwin Sah, Mehtaab Sawhney

摘要:

设$A$是一个$d$-正则有向图在$n$顶点上的邻接矩阵,并假设$\min(d,n-d)\geqλn$。我们表明,对于任何$κ\geq 0$,\[\mathbb{P}[s_n(A)\leqκ]\leq C_λκ\sqrt{n}+2e^{-c_λn}.\]直到常数$C_λ, c_λ> 0$,我们的界匹配$n\times n$随机矩阵的最优界,其每个条目是一个独立同分布的$\text{Ber}(d/n)$随机变量。我们的结果的特殊情况$κ= 0$证实了Cook关于稠密随机正则有向图奇异概率的一个猜想。

英文摘要:

Let $A$ be the adjacency matrix of a uniformly random $d$-regular digraph on $n$ vertices, and suppose that $\min(d,n-d)\geqλn$. We show that for any $κ\geq 0$, \[\mathbb{P}[s_n(A)\leqκ]\leq C_λκ\sqrt{n}+2e^{-c_λn}.\] Up to the constants $C_λ, c_λ> 0$, our bound matches optimal bounds for $n\times n$ random matrices, each of whose entries is an i.i.d $\text{Ber}(d/n)$ random variable. The special case $κ= 0$ of our result confirms a conjecture of Cook regarding the probability of singularity of dense random regular digraphs.

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

↑