DeepAI AI Chat
Log In Sign Up

Group Testing with Non-identical Infection Probabilities

by   Mustafa Doger, et al.
University of Maryland

We consider a zero-error probabilistic group testing problem where individuals are defective independently but not with identical probabilities. We propose a greedy set formation method to build sets of individuals to be tested together. We develop an adaptive group testing algorithm that uses the proposed set formation method recursively. We prove novel upper bounds on the number of tests for the proposed algorithm. Via numerical results, we show that our algorithm outperforms the state of the art, and performs close to the entropy lower bound.


page 1

page 2

page 3

page 4


Group Testing with a Graph Infection Spread Model

We propose a novel infection spread model based on a random connection g...

Adaptive Group Testing Algorithms to Estimate the Number of Defectives

We study the problem of estimating the number of defective items in adap...

Probabilistic Group Testing under Sum Observations: A Parallelizable 2-Approximation for Entropy Loss

We consider the problem of group testing with sum observations and noise...

Adaptive Group Testing on Networks with Community Structure

Since the inception of the group testing problem in World War II, the pr...

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

We study the group testing problem with non-adaptive randomized algorith...

Variable pool testing for infection spread estimation

We present a method for efficient estimation of the prevalence of infect...

Engineering a Fast Probabilistic Isomorphism Test

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism te...