AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Learning Erdos-Renyi Random Graphs via Edge Detecting Queries

Zihan Li, Matthias Fresacher, Jonathan Scarlett

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Graph comparison and random features

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 changedWhereMeasuredEffect
Use DD decoding instead of COMPNon-adaptive Bernoulli graph learning · ER(n,q), θ ∈ (0,1)tests for vanishing error: 2e · k̄ log n -> 2 max{θ, 1-θ}e · k̄ log nImproved
Use DD under Bernoulli testing when θ > 1/2Non-adaptive ER graph learning · ER(n,q), θ > 1/2asymptotic test threshold: 2θe · k̄ log nNo clear effect
Set Bernoulli testing parameter to ν = 1COMP and DD · ER(n,q), θ ∈ (0,1)tests for vanishing errorImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy