Statistical limits for testing correlation of random hypergraphs

MaRDI QIDQ6564542zbMATH OpenFDO

Authors Mingao Yuan, Zuofeng Shang

Publication date 1 July 2024

Published in ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)

zbMATH Keywords

uniform hypergraphstatistical limitErdős-Rényi hypergraphGaussian-Wigner hypergraphhypergraph correlation

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• scientific article; zbMATH DE number 7626795 (Why is no real title available?)
• Community detection in degree-corrected block models
• Community detection with nodal information: likelihood and its variational approximation
• Efficient random graph matching via degree profiles
• Optimal adaptivity of signed-polygon statistics for network testing
• Proceedings of the 7th ACM conference on innovations in theoretical computer science, ITCS'16, Cambridge, MA, USA, January 14--16, 2016
• Spectral alignment of correlated Gaussian matrices
• Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis
• Spectral graph matching and regularized quadratic relaxations. II: Erdős-Rényi graphs and universality
• Testing community structure for hypergraphs
• Testing correlation of unlabeled random graphs
• The cycle structure of random permutations

This page was built for publication: Statistical limits for testing correlation of random hypergraphs

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