arXiv (All)
open access
Leave-One-Out Neighborhood Smoothing for Graphons: Berry--Esseen Bounds and Edge-Wise Confidence Intervals
We develop a framework for edge-wise inference in graphon-based random networks. The proposed leave-one-out neighborhood procedure excludes the target vertex when selecting neighbors, then averages the selected vertices' edges to that target. Conditional on the latent probabilities and selected neig
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
- Exact Recovery by Neighborhood Smoothing in Directed Stochastic Block Models#1083019
- Introvert Clustering for Distributed Graph Algorithms#996842
- Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes#1143025
- Training with Missed Targets in Generative Recommendation: Separating Supervision from Probability Competition#1234491
- Asymptotically perfect seeded graph matching without edge correlation (and applications to inference)#670343
Record · ID 1491467
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