Testing network correlation efficiently via counting trees

DOI10.1214/23-AOS2261MaRDI QIDQ7035877zbMATH OpenFDO

Authors Cheng Mao, Yihong Wu, Jiaming Xu, Sophie H. Yu

Publication date 29 January 2025

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/annals-of-statistics/volume-52/issue-6/Testing-network-correlation-efficiently-via-counting-trees/10.1214/23-AOS2261.full

zbMATH Keywords

graph matchinglow-degree polynomialscorrelated Erdős-Rényi graphscounting signed treesdetecting network correlation

Mathematics Subject Classification ID

Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

This page was built for publication: Testing network correlation efficiently via counting trees

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