arXiv (All)
open access
Discrete Poincaré inequalities and universal approximators for random graphs
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
- Discrete Poincaré inequalities and universal approximators for random graphs#617336
- Maximal Minimal Spacing for Random Points#926067
- Fast Graph Laplacian Estimation using Effective Resistance#1049405
- Sharp Thresholds for Distance Patterns in Random Subsets of $\mathbb Z^d$#1130864
- Limit theorems for stochastic gradient descent in high-dimensional single-layer networks#675881
Record · ID 617836
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