arXiv (All)
open access
Sample Complexity of Correlation Detection in Erdős-Rényi graphs
In this paper, we study correlation detection problem between a pair of Erdős-Rényi graphs. Under the null hypothesis, the two graphs are independent, whereas under the alternative, they are edge-correlated through a latent permutation. We consider the partial-observation setting in which only an in
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
- Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques#1051182
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#793494
- On the Parameterized Complexity of $s$-Club Cluster Edge Deletion#789490
- Kernelization of 2-Club Cluster Edge Deletion on Interval Graphs#821011
- On the intersection of pairs of trees#987405
Record · ID 821772
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