English
Related papers

Related papers: Individual testing is optimal for nonadaptive grou…

200 papers

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from $\{0,1\}$ with a fixed probability $p$. The…

Machine Learning · Computer Science 2017-08-10 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla

We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Poisson model has a number of new applications, including…

Information Theory · Computer Science 2023-07-19 Amin Emad , Olgica Milenkovic

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with…

Data Structures and Algorithms · Computer Science 2021-12-24 Oliver Gebhard , Max Hahn-Klimroth , Olaf Parczyk , Manuel Penschuck , Maurice Rolvien , Jonathan Scarlett , Nelvin Tan

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

In this paper, we introduce a variation of the group testing problem where each test is specified by an ordered subset of items and returns the first defective item in the specified order or returns null if there are no defectives. We refer…

Information Theory · Computer Science 2024-09-30 Waqar Mirza , Nikhil Karamchandani , Niranjan Balachandran

The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no…

Information Theory · Computer Science 2026-05-15 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test…

Information Theory · Computer Science 2013-04-25 Chun Lam Chan , Sheng Cai , Mayank Bakshi , Sidharth Jaggi , Venkatesh Saligrama

We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under…

Information Theory · Computer Science 2017-11-16 Matthew Aldridge

We study the problem of identifying defective units in a finite population of \( n \) units, where each unit \( i \) is independently defective with known probability \( p_i \). This setting is referred to as the \emph{Generalized Group…

Statistics Theory · Mathematics 2025-06-23 Yaakov Malinovsky , Viktor Skorniakov

Consider a very large (infinite) population of items, where each item independent from the others is defective with probability p, or good with probability q=1-p. The goal is to identify N good items as quickly as possible. The following…

Other Statistics · Statistics 2018-04-17 Yaakov Malinovsky

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 ${\cal M}$, let $m_{\cal M}(n,d)$ be the minimum…

Machine Learning · Computer Science 2019-11-06 Nader H. Bshouty , George Haddad , Catherine A. Haddad-Zaknoon

The goal of group testing is to efficiently identify a few specific items, called positives, in a large population of items via tests. A test is an action on a subset of items which returns positive if the subset contains at least one…

Information Theory · Computer Science 2021-11-08 Thach V. Bui , Mahdi Cheraghchi , An T. H. Nguyen , Thuc D. Nguyen

The original problem of group testing consists in the identification of defective items in a collection, by applying tests on groups of items that detect the presence of at least one defective item in the group. The aim is then to identify…

Applications · Statistics 2021-06-10 Emilien Joly , Bastien Mallein

We consider the problem of identifying the defectives from a population of items via a non-adaptive group testing framework with a random pooling-matrix design. We analyze the sufficient number of tests needed for approximate set…

Information Theory · Computer Science 2024-12-03 Sameera Bharadwaja H. , Chandra R. Murthy

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2018-10-05 Jonathan Scarlett

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find…

Data Structures and Algorithms · Computer Science 2016-06-13 Annalisa De Bonis

Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least…

Data Structures and Algorithms · Computer Science 2023-08-16 Nader H. Bshouty

We explore the problem of deriving a posteriori probabilities of being defective for the members of a population in the non-adaptive group testing framework. Both noiseless and noisy testing models are addressed. The technique, which relies…

Information Theory · Computer Science 2021-02-11 Gianluigi Liva , Enrico Paolini , Marco Chiani

In one-stage or non-adaptive group testing, instead of testing every sample unit individually, they are split, bundled in pools, and simultaneously tested. The results are then decoded to infer the states of the individual items. This…

Applications · Statistics 2020-12-04 Christoph Schumacher , Matthias Täufer

We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…

Information Theory · Computer Science 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama