"Information limits for detecting a subhypergraph" by Mingao Yuan and Zuofeng Shang
 

Information limits for detecting a subhypergraph

Document Type

Article

Publication Date

12-1-2021

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.

Identifier

85118484575 (Scopus)

Publication Title

Stat

External Full Text Location

https://doi.org/10.1002/sta4.407

e-ISSN

20491573

Issue

1

Volume

10

This document is currently not available here.

Share

COinS