Heterogeneous dense subhypergraph detection

DOI10.1111/STAN.12360MaRDI QIDQ6668604zbMATH OpenFDO

Authors Mingao Yuan, Zuofeng Shang

Publication date 22 January 2025

Published in Statistica Neerlandica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/STAN.12360

zbMATH Keywords

asymptotically powerful testdense subhypergraphdetection boundaryheterogeneous uniform hypergraph

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Hypergraphs (05C65) Minimax procedures in statistical decision theory (62C20) Parametric hypothesis testing (62F03) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Sharp detection boundaries on testing dense subhypergraph
• Testing community structure for hypergraphs
• Community detection in dense random networks
• Community detection in sparse random networks

Cites work

• Community detection in dense random networks
• Community detection in sparse random networks
• Consistency of spectral hypergraph partitioning under planted partition model
• Detecting a planted community in an inhomogeneous random graph
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Laplacian eigenvalues and partition problems in hypergraphs
• Spectra, Euclidean representations and clusterings of hypergraphs
• The densest k-subhypergraph problem

Cited in

(1)

• The low-degree hardness of finding large independent sets in sparse random hypergraphs

This page was built for publication: Heterogeneous dense subhypergraph detection

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