Research map / Graph learning / Graph algorithms and clustering
Learning Erdos-Renyi Random Graphs via Edge Detecting Queries
Zihan Li, Matthias Fresacher, Jonathan Scarlett
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use DD decoding instead of COMP | Non-adaptive Bernoulli graph learning · ER(n,q), θ ∈ (0,1) | tests for vanishing error: 2e · k̄ log n -> 2 max{θ, 1-θ}e · k̄ log n | Improved |
| Use DD under Bernoulli testing when θ > 1/2 | Non-adaptive ER graph learning · ER(n,q), θ > 1/2 | asymptotic test threshold: 2θe · k̄ log n | No clear effect |
| Set Bernoulli testing parameter to ν = 1 | COMP and DD · ER(n,q), θ ∈ (0,1) | tests for vanishing error | Improved |
Closest papers by meaning
- Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point (NeurIPS 2025 · similarity 0.87)
- Optimal community detection in dense bipartite graphs (NeurIPS 2025 · similarity 0.86)
- Query-Limited Community Recovery in Stochastic Block Models (NeurIPS 2026 · similarity 0.85)
- The Query Complexity of Local Search in Rounds on General Graphs (NeurIPS 2026 · similarity 0.85)
- Robust Offline Active Learning on Graphs (NeurIPS 2024 · similarity 0.85)
- Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust (NeurIPS 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
