Statistical limits for testing correlation of random hypergraphs

MaRDI QIDQ6564542

Zuofeng Shang, Mingao Yuan

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

• Unnamed Item
• The cycle structure of random permutations
• Community detection in degree-corrected block models
• Optimal adaptivity of signed-polygon statistics for network testing
• Testing community structure for hypergraphs
• Efficient random graph matching via degree profiles
• Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
• Spectral alignment of correlated Gaussian matrices
• Seeded graph matching via large neighborhood statistics
• 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 correlation of unlabeled random graphs
• Community detection with nodal information: likelihood and its variational approximation

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