加载中…
Let be the (non-symmetric) adjacency matrix of a uniformly random -regular directed graph on vertices, and let be independent of with i.i.d. Rademacher entries. Suppose that for some fixed . We show that there exists , depending only on , such that As an ingredient in the proof of the rank bound, we use the case of the following quantitative smallest singular value estimate: where depend only on .

生成讲解博客的中文版本

生成AI智能校验的中文版本