Research map / Graph learning / Graph algorithms and clustering
On the Propagation of Low-Rate Measurement Error to Subgraph Counts in Large Networks
Prakash Balachandran, Eric D. Kolaczyk, Weston D. Viles
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Estimating the Number of Induced Subgraphs from Incomplete Data and Neighborhood Queries (AAAI 2021 · similarity 0.88)
- Quantifying Network Similarity using Graph Cumulants (JMLR 2023 · similarity 0.86)
- Estimating the Size of a Large Network and its Communities from a Random Sample (NeurIPS 2016 · similarity 0.86)
- Network two-sample test for block models (NeurIPS 2025 · similarity 0.85)
- Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point (NeurIPS 2025 · similarity 0.85)
- Fast Wasserstein rates for estimating probability distributions of probabilistic graphical models (NeurIPS 2026 · 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.
