arXiv (OAI Expanded)
open access
Sharp Norms from Finite Structure: Graph Matrices and Structured Chaoses
Graph matrices encode dependencies in random matrices built from shared random variables and arise in spectral algorithms, sum-of-squares (SoS), and high-dimensional statistics. We determine how finite graph structure controls their sharp spectral growth. For every fixed simple graph shape in the de
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
- Small-Ball Marginals Do Not Control Restricted Eigenvalues by Euclidean Gaussian Width#999481
- A geodesic distance interpretation of Lanczos coefficients#926174
- The voter model on the hyperbolic graph#821115
- Certificate-Coupled DCA for the Trust-Region Subproblem: Early Structural Escape and Progressive Global Certification#1154795
- Kac-Rice inspired approach to non-Hermitian random matrices#1082953
Record · ID 1083722
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