arXiv (All)
open access
The spectral edge of sparse directed Erdös-Rényi graphs
Let $d>1$ be fixed and let $A_n$ be an $n\times n$ matrix with independent $\Ber(d/n)$ entries. For every $0<r<\sqrt d$, we prove that, with high probability, a positive proportion of the eigenvalues of $A_n$ have modulus larger than $r$. Together with the known upper bound, this implies that the mo
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
- Extremal Graphs with Prescribed Parameters for the Spectral Radius of Weighted Adjacency Matrices with Property $P^{\ast}$#1104502
- Maximum and Minimum Spectral Radii in an Exceptional Family for Edge-Disjoint Spanning Trees#1014244
- Outliers and bounded rank perturbation for non-Hermitian random band matrices#1034162
- Supporting data for "Many-body first principles calculations of carrier mobility with record accuracy using GW perturbation theory"#275072
- MMSE Channel Estimation in Fading MIMO Gaussian Channels With Blockage: A Novel Lower Bound via Poincaré Inequality#1014477
Record · ID 1012556
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