arXiv (All)
open access
Spectrum of Directed Inhomogeneous Random Graphs
We study the spectrum of the adjacency matrix $A_n$ of directed inhomogeneous random graphs on $n$ vertices. We assume that $A_n$ has independent entries and diverging average degree scale $s_n$. This framework includes, as special cases, the directed Chung--Lu random graph and directed stochastic b
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
- Limit theorems for spectra of random matrices with martingale structure#492600
- The Spectral Region of Two-Layer Renewal Stochastic Matrices#1115724
- Local laws and spectral properties of deformed sparse random matrices#179199
- Incompressibility and spectral gaps of random circuits#1051965
- Limit theorems for linear spectrum statistics of orthogonal polynomial ensembles and their applications in random matrix theory#366889
Record · ID 1297195
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