Statistical and computational thresholds for the planted $k$-densest sub-hypergraph problem

Luca Corinzia, Paolo Penna, Wojciech Szpankowski +1

In this work, we consider the problem of recovery a planted $k$-densest sub-hypergraph on $d$-uniform hypergraphs. This fundamental problem appears in different contexts, e.g., com…