DeepAI AI Chat
Log In Sign Up

Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing

by   Nader H. Bshouty, et al.

We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For a model M, let m_ M(n,d) be the minimum number of tests required to detect at most d defectives within n items, with success probability at least 1-δ, for some constant δ. In this paper, we study the measures c_ M(d)=lim_n→∞m_ M(n,d)/ln n c_ M=lim_d→∞c_ M(d)/d. In the literature, the analyses of such models only give upper bounds for c_ M(d) and c_ M, and for some of them, the bounds are not tight. We give new analyses that yield tight bounds for c_ M(d) and c_ M for all the known models M.


page 1

page 2

page 3

page 4


Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

We study the problem of determining exactly the number of defective item...

The Complexity of Subdivision for Diameter-Distance Tests

We present a general framework for analyzing the complexity of subdivisi...

Geometric group testing

Group testing is concerned with identifying t defective items in a set o...

Noisy Adaptive Group Testing: Bounds and Algorithms

The group testing problem consists of determining a small set of defecti...

Unconstraining graph-constrained group testing

In network tomography, one goal is to identify a small set of failed lin...

Group Testing with Non-identical Infection Probabilities

We consider a zero-error probabilistic group testing problem where indiv...

Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives

We study the problem of estimating the number of defective items d withi...