Performance Bounds for Group Testing With Doubly-Regular Designs

01/11/2022
by   Nelvin Tan, et al.
0

In the group testing problem, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, DNA sequencing, and communications. In this paper, we study a doubly-regular design in which the number of tests-per-item and the number of items-per-test are fixed. We analyze the performance of this test design alongside the Definite Defectives (DD) decoding algorithm in several settings, namely, (i) the sub-linear regime k=o(n) with exact recovery, (ii) the linear regime k=Θ(n) with approximate recovery, and (iii) the size-constrained setting, where the number of items per test is constrained. Under setting (i), we show that our design together with the DD algorithm, matches an existing achievability result for the DD algorithm with the near-constant tests-per-item design, which is known to be asymptotically optimal in broad scaling regimes. Under setting (ii), we provide novel approximate recovery bounds that complement a hardness result regarding exact recovery. Lastly, under setting (iii), we improve on the best known upper and lower bounds in scaling regimes where the maximum allowed test size grows with the total number of items.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2020

Improved Bounds and Algorithms for Sparsity-Constrained Group Testing

In group testing, the goal is to identify a subset of defective items wi...
research
04/07/2020

Near-Optimal Sparse Adaptive Group Testing

In group testing, the goal is to identify a subset of defective items wi...
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
10/18/2017

Phase Transitions in the Pooled Data Problem

In this paper, we study the pooled data problem of identifying the label...
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
06/12/2021

Probabilistic Group Testing with a Linear Number of Tests

In probabilistic nonadaptive group testing (PGT), we aim to characterize...
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...

Please sign up or login with your details

Forgot password? Click here to reset