Statistical limits for testing correlation of random hypergraphs
From MaRDI portal
Publication:6564542
Publication date: 1 July 2024
Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)
uniform hypergraphstatistical limitErdős-Rényi hypergraphGaussian-Wigner hypergraphhypergraph correlation
Cites Work
- Title not available (Why is that?)
- Community detection in degree-corrected block models
- Optimal adaptivity of signed-polygon statistics for network testing
- Efficient random graph matching via degree profiles
- The cycle structure of random permutations
- Proceedings of the 7th ACM conference on innovations in theoretical computer science, ITCS'16, Cambridge, MA, USA, January 14--16, 2016
- Testing community structure for hypergraphs
- Testing correlation of unlabeled random graphs
- Seeded graph matching via large neighborhood statistics
- 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
- Community detection with nodal information: likelihood and its variational approximation
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)
