登录 注册

Large corank of dense random regular digraphs

🔗 访问原文
🔗 Access Paper

📝 摘要
Abstract

Let $1\le k\le n$ and let $A$ be the adjacency matrix of a uniformly random $d$-regular directed graph on $n$ vertices. Suppose that $λn\le d \le (1-λ)n$ for a fixed $0<λ\le 1/2$. We show that there exists $c_λ>0$ depending only on $λ$ such that $$ \mathbb{P}[\operatorname{rank}(A)\le n-k]\le 2e^{-c_λ kn}. $$ This gives a large corank extension of the exponential singularity bound of Jain, Sah, and Sawhney.

📊 文章统计
Article Statistics

基础数据
Basic Stats

136 浏览
Views
0 下载
Downloads
16 引用
Citations

引用趋势
Citation Trend

阅读国家分布
Country Distribution

阅读机构分布
Institution Distribution

月度浏览趋势
Monthly Views

相关关键词
Related Keywords

影响因子分析
Impact Analysis

7.00 综合评分
Overall Score
引用影响力
Citation Impact
浏览热度
View Popularity
下载频次
Download Frequency

📄 相关文章
Related Articles

海洋智能分析Ocean AI Analysis

正在分析中,请稍候…Analyzing, please wait…
海洋智能体 🌊
海洋智能体
AI科研助手 · 3888篇文献
我看到你正在阅读一篇文献,需要我帮你解读摘要、推荐相关论文,或者分析研究方法论吗?