arXiv (All)
open access
Quality control in sublinear time: a case study via random graphs
Many algorithms are designed to work well on average over inputs. But when such an algorithm is run on an arbitrary input, the question arises: Can we trust the algorithm on this input? This question is especially relevant in network science, where algorithms for theoretical random graph models are
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
- Algorithmic Fairness Over Time: Advances & Prospects#1325911
- Learning Dynamic Stability Landscapes in Synchronization Networks#222594
- Dynamic Directed Random Matching#21611
- Bounded Independence Edge Subsampling in Graphs#347579
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
Record · ID 1357035
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