Learning a hidden hypergraph is a natural generalization of the classical group testing problem that consists in detecting unknown hypergraph H un  = H(V, E) by carrying out edge-detecting tests. In the given paper we focus our attention only on a specific family Ƒ(t, s, l) of localized hypergraphs for which the total number of vertices |V| = t, the number of edges |E| ≤ s, s ≪ t, and the cardinality of any edge |e| ≤ l, l ≪ t. Our goal is to identify all edges of H un  ∈ Ƒ(t, s, l) by using the minimal number of tests. We develop an adaptive algorithm that matches the information theory bound, i.e., the total number of tests of the algorithm in the worst case is at most sl log 2  t(1+o(1)). We also discuss a probabilistic generalization of the problem.
["Arkadii G. D'yachkov", 'I. V. Vorobyev', 'Nikita Polyanskii', 'V. Yu. Shchukin']
On multistage learning a hidden hypergraph