Sample Complexity of Correlation Detection in Erdős-Rényi graphs

Abstract

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 induced subgraph of each graph is sampled, and determine the sharp information-theoretic threshold for the sample size, including its leading constant. We also establish a general conditional second moment principle and identify a continuous transition in the sharp threshold constant across two different regimes.

arXiv comment37 pages, 3 figures