On the All-Or-Nothing Behavior of Bernoulli Group Testing

01/28/2020
by   Lan V. Truong, et al.
0

In this paper, we study the problem of group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was included in the test. The most widespread recovery criterion seeks to exactly recovery the entire defective set, and relaxed criteria such as approximate recovery and list decoding have also been considered. In this paper, we study the fundamental limits of group testing under two significantly relaxed criteria: The weak detection criterion only seeks to distinguish (with high probability) between whether the outcomes were produced according to the group testing model or independently from the test design, and the weak recovery criterion only seeks to identify a small fraction (e.g., 0.01) of the defective items. In the case of Bernoulli random testing, we identify scenarios in which an all-or-nothing phenomenon occurs: When the number of tests is slightly below a threshold, weak detection and weak recovery are impossible, whereas when the number of tests is slightly above the same threshold, high-probability exact recovery is possible. Our impossibility results significantly strengthen existing ones that only hold for stricter recovery criteria.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2022

Model-Based and Graph-Based Priors for Group Testing

The goal of the group testing problem is to identify a set of defective ...
research
06/02/2020

Non-Adaptive Group Testing in the Linear Regime: Strong Converse and Approximate Recovery

In this paper, we consider the non-adaptive group testing problem in the...
research
06/01/2021

Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing

In group testing, the goal is to identify a subset of defective items wi...
research
11/06/2019

Optimal non-adaptive group testing

In non-adaptive group testing we aim to identify a small set of k∼ n^θ i...
research
06/18/2020

A Fast Binary Splitting Approach to Non-Adaptive Group Testing

In this paper, we consider the problem of noiseless non-adaptive group t...
research
10/15/2019

Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes

This paper considers the problem of Quantitative Group Testing (QGT) whe...
research
11/10/2020

Group testing and local search: is there a computational-statistical gap?

In this work we study the fundamental limits of approximate recovery in ...

Please sign up or login with your details

Forgot password? Click here to reset