We consider the problem of recovering a subhypergraph based on an observed adjacency tensor corresponding to a uniform hypergraph. The uniform hypergraph is assumed to contain a subset of vertices called as subhypergraph. The edges restricted to the subhypergraph are assumed to follow a different probability distribution than other edges. We consider both weak recovery and exact recovery of the subhypergraph, and establish information-theoretic limits in each case. Specifically, we establish sharp conditions for the possibility of weakly or exactly recovering the subhypergraph from an information-theoretic point of view. These conditions are fundamentally different from their counterparts derived in the hypothesis testing literature.

中文翻译：

---

检测子超图的信息限制

我们考虑基于对应于统一超图的观察到的邻接张量来恢复子超图的问题。假设统一超图包含称为子超图的顶点子集。假设限于子超图的边遵循与其他边不同的概率分布。我们考虑子超图的弱恢复和精确恢复，并在每种情况下建立信息论限制。具体来说，我们为从信息论的角度弱或准确地恢复子超图的可能性建立了尖锐的条件。这些条件与假设检验文献中得出的对应条件有着根本的不同。