Can I read Information-Theoretic and Computational Limits of Correlation Detection Under Graph Sampling on EtoBox?
Information-Theoretic and Computational Limits of Correlation Detection Under Graph Sampling by shinyotian is a document available to read on EtoBox.
What is Information-Theoretic and Computational Limits of Correlation Detection Under Graph Sampling about?
This paper addresses the correlation detection problem between pairs of Erdős-Rényi graphs, framed as a hypothesis testing scenario where the null hypothesis assumes independence and the alternative suggests edge correlation via a latent permutation. The authors establish optimal sample complexity rates for detection and propose polynomial-time tests based on counting trees and motifs, demonstrating their effectiveness on synthetic and real data. Additionally, the study highlights a statistical-computatio
- Author
- shinyotian
- Language
- EN