Detection threshold for correlated Erdős-Rényi graphs via densest subgraph

DOI10.1109/TIT.2023.3265009MaRDI QIDQ6574816zbMATH OpenFDO

Authors Jian Ding, Hang Du

Publication date 18 July 2024

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

hypothesis testing problemErdős-Rényi random graphsdetecting edge correlationunlabeled nodes

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80)

Cited in

(2)

• Statistical limits of correlation detection in trees
• A polynomial-time approximation scheme for the maximal overlap of two independent Erdős-Rényi graphs

This page was built for publication: Detection threshold for correlated Erdős-Rényi graphs via densest subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574816)