arXiv (All)
open access
Rank and Invertibility of Dense Signed Random Regular Matrices
Let $A$ be the (non-symmetric) adjacency matrix of a uniformly random $d$-regular directed graph on $n$ vertices, and let $Ξ$ be independent of $A$ with i.i.d. Rademacher entries. Suppose that $\min(d,n-d)\geλn$ for some fixed $λ\in(0,1/2]$. We show that there exists $c > 0$, depending only on $λ$,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal central limit theorem for bounded random variables in high dimensions#975131
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#625427
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#623154
- Sharp spectral norm concentration of sparse random tensors#1034336
- Density and Chromatic Index, and Minimum Ranks of Sign Pattern Matrices#492237
Record · ID 1202357
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive