English
Related papers

Related papers: Group testing with Random Pools: Phase Transitions…

200 papers

We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…

Information Theory · Computer Science 2018-07-24 Tongxin Li , Chun Lam Chan , Wenhao Huang , Tarik Kaced , Sidharth Jaggi

Group testing enables the identification of a small subset of defective items within a larger population by performing tests on pools of items rather than on each item individually. Over the years, it has not only attracted attention from…

Information Theory · Computer Science 2026-01-13 Manuel Franco-Vivo

Group testing is an approach aimed at identifying up to $d$ defective items among a total of $n$ elements. This is accomplished by examining subsets to determine if at least one defective item is present. In our study, we focus on the…

Data Structures and Algorithms · Computer Science 2023-07-12 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-10-24 Eric Price , Jonathan Scarlett , Nelvin Tan

In industrial engineering and manufacturing, quality control is an essential part of the production process of a product. To ensure proper functionality of a manufactured good, rigorous testing has to be performed to identify defective…

Methodology · Statistics 2025-04-02 Michael Balzer

An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occurs…

Combinatorics · Mathematics 2016-09-06 Emanuel Knill

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

Detection of rare traits or diseases in a large population is challenging. Pool testing allows covering larger swathes of population at a reduced cost, while simplifying logistics. However, testing precision decreases as it becomes unclear…

Information Theory · Computer Science 2021-06-22 Éric Brier , Megi Dervishi , Rémi Géraud-Stewart , David Naccache , Ofer Yifrach-Stav

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

Group testing is concerned with identifying $t$ defective items in a set of $m$ items, where each test reports whether a specific subset of items contains at least one defective. In non-adaptive group testing, the subsets to be tested are…

Computational Geometry · Computer Science 2020-12-03 Benjamin Aram Berendsohn , László Kozma

Non-adaptive group testing involves grouping arbitrary subsets of $n$ items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to…

Discrete Mathematics · Computer Science 2011-07-26 Mahdi Cheraghchi , Amin Karbasi , Soheil Mohajer , Venkatesh Saligrama

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

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…

Information Theory · Computer Science 2021-08-30 Mustafa Doger , Sennur Ulukus

In probabilistic nonadaptive group testing (PGT), we aim to characterize the number of pooled tests necessary to identify a random $k$-sparse vector of defectives with high probability. Recent work has shown that $n$ tests are necessary…

Information Theory · Computer Science 2021-06-15 Larkin Flodin , Arya Mazumdar

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-07-05 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the…

Combinatorics · Mathematics 2012-04-09 Dániel Gerbner , Balázs Keszegh , Dömötör Pálvölgyi , Gábor Wiener

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

The use of group testing to locate all instances of disease in a large population of blood samples was first considered seventy years ago. Since then, several methods have been used to approximate the minimum expected number of tests. The…

Applications · Statistics 2015-03-24 Seth Zimmerman

Group testing is a well known search problem that consists in detecting up to $s$ defective elements of the set $[t]=\{1,\ldots,t\}$ by carrying out tests on properly chosen subsets of $[t]$. In classical group testing the goal is to find…

Information Theory · Computer Science 2016-11-18 A. G. D'yachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at…

Information Theory · Computer Science 2021-08-24 Thach V. Bui , Mahdi Cheraghchi , Isao Echizen