Group Testing with Non-identical Infection Probabilities
- URL: http://arxiv.org/abs/2108.12418v1
- Date: Fri, 27 Aug 2021 17:53:25 GMT
- Title: Group Testing with Non-identical Infection Probabilities
- Authors: Mustafa Doger and Sennur Ulukus
- Abstract summary: We develop an adaptive group testing algorithm using the set formation method.
We show that our algorithm outperforms the state of the art, and performs close to the entropy lower bound.
- Score: 59.96266198512243
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Concomitant Group Testing [49.50984893039441]
We introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple types'' of item.
The goal is to reliably identify all of the semi-defective sets using as few tests as possible.
Our algorithms are distinguished by (i) whether they are deterministic (zero-error) or randomized (small-error), and (ii) whether they are non-adaptive, fully adaptive, or have limited adaptivity.
arXiv Detail & Related papers (2023-09-08T09:11:12Z) - Statistical and Computational Phase Transitions in Group Testing [73.55361918807883]
We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease.
We consider two different simple random procedures for assigning individuals tests.
arXiv Detail & Related papers (2022-06-15T16:38:50Z) - Group Testing with a Graph Infection Spread Model [61.48558770435175]
Infection spreads via connections between individuals and this results in a probabilistic cluster formation structure as well as a non-i.i.d. infection status for individuals.
We propose a class of two-step sampled group testing algorithms where we exploit the known probabilistic infection spread model.
Our results imply that, by exploiting information on the connections of individuals, group testing can be used to reduce the number of required tests significantly even when infection rate is high.
arXiv Detail & Related papers (2021-01-14T18:51:32Z) - Efficient Detection Of Infected Individuals using Two Stage Testing [0.0]
Group testing is an efficient method for testing a large population to detect infected individuals.
We characterize the efficiency of several two stage group testing algorithms.
In the optimal setting, our testing scheme is robust to errors in the input parameters.
arXiv Detail & Related papers (2020-08-24T23:05:10Z) - Bloom Origami Assays: Practical Group Testing [90.2899558237778]
Group testing is a well-studied problem with several appealing solutions.
Recent biological studies impose practical constraints for COVID-19 that are incompatible with traditional methods.
We develop a new method combining Bloom filters with belief propagation to scale to larger values of n (more than 100) with good empirical results.
arXiv Detail & Related papers (2020-07-21T19:31:41Z) - Noisy Adaptive Group Testing using Bayesian Sequential Experimental
Design [63.48989885374238]
When the infection prevalence of a disease is low, Dorfman showed 80 years ago that testing groups of people can prove more efficient than testing people individually.
Our goal in this paper is to propose new group testing algorithms that can operate in a noisy setting.
arXiv Detail & Related papers (2020-04-26T23:41:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.