Sharp detection boundaries on testing dense subhypergraph

DOI10.3150/21-BEJ1425zbMath1497.05196arXiv2101.04584OpenAlexW3118293634WikidataQ113701726 ScholiaQ113701726MaRDI QIDQ2676927

Zuofeng Shang, Mingao Yuan

Publication date: 28 September 2022

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.04584

zbMATH Keywords

uniform hypergraphasymptotically powerful testdense subhypergraph detectionsharp detection boundary

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (2)

Phase transitions in a power-law uniform hypergraph ⋮ Community Detection in Censored Hypergraph

Cites Work

• Optimal detection of sparse principal components in high dimension
• Consistency of spectral hypergraph partitioning under planted partition model
• Spectra, Euclidean representations and clusterings of hypergraphs
• Community detection in sparse random networks
• The Ramsey number of generalized loose paths in hypergraphs
• Laplacian eigenvalues and partition problems in hypergraphs
• Tensor clustering with planted structures: statistical optimality and computational limits
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Community detection in dense random networks
• The Densest $k$-Subhypergraph Problem
• Cliques in random graphs
• Test dense subgraphs in sparse uniform hypergraph
• A Direct Formulation for Sparse PCA Using Semidefinite Programming

This page was built for publication: Sharp detection boundaries on testing dense subhypergraph