2021
DOI: 10.1002/sta4.407
|View full text |Cite
|
Sign up to set email alerts
|

Information limits for detecting a subhypergraph

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 f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…A related line of literature focuses on the detection of planted sub-hypergraphs [28,29] and testing for the presence of community structure in hypergraphs [30,31].…”
Section: Introductionmentioning
confidence: 99%
“…A related line of literature focuses on the detection of planted sub-hypergraphs [28,29] and testing for the presence of community structure in hypergraphs [30,31].…”
Section: Introductionmentioning
confidence: 99%