Information limits for detecting a subhypergraph

Mingao Yuan, Zuofeng Shang

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish (US)
Article numbere407
JournalStat
Volume10
Issue number1
DOIs
StatePublished - Dec 2021

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty

Fingerprint

Dive into the research topics of 'Information limits for detecting a subhypergraph'. Together they form a unique fingerprint.

Cite this