English
Related papers

Related papers: The capacity of Bernoulli nonadaptive group testin…

200 papers

The basic goal in combinatorial group testing is to identify a set of up to $d$ defective items within a large population of size $n \gg d$ using a pooling strategy. Namely, the items can be grouped together in pools, and a single…

Discrete Mathematics · Computer Science 2013-01-21 Mahdi Cheraghchi

The conventional model of disjunctive group testing assumes that there are several defective elements (or defectives) among a large population, and a group test yields the positive response if and only if the testing group contains at least…

Information Theory · Computer Science 2019-08-20 A. G. D'yachkov , N. A. Polyanskii , V. Yu. Shchukin , I. V. Vorobyev

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 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

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of…

Information Theory · Computer Science 2016-04-05 Jonathan Scarlett , Volkan Cevher

We prove new strong converse results in a variety of group testing settings, generalizing a result of Baldassini, Johnson and Aldridge. These results are proved by two distinct approaches, corresponding to the non-adaptive and adaptive…

Information Theory · Computer Science 2017-08-22 Oliver Johnson

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

In this paper, we propose a computer-oriented method of construction of optimal group sequential hypothesis tests with variable group sizes. In particular, for independent and identically distributed observations we obtain the form of…

Methodology · Statistics 2023-03-30 Andrey Novikov

In this work we prove non-trivial impossibility results for perhaps the simplest non-linear estimation problem, that of {\it Group Testing} (GT), via the recently developed Madiman-Tetali inequalities. Group Testing concerns itself with…

Information Theory · Computer Science 2018-04-11 Abhishek Agarwal , Sidharth Jaggi , Arya Mazumdar

We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of pooled tests which return positive whenever there is at least…

Machine Learning · Statistics 2022-06-16 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Alexander S. Wein , Ilias Zadik

Group testing concerns itself with the accurate recovery of a set of "defective" items from a larger population via a series of tests. While most works in this area have considered the classical group testing model, where tests are binary…

Information Theory · Computer Science 2026-05-13 Daniel McMorrow , Nikhil Karamchandani , Sidharth Jaggi

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

Information Theory · Computer Science 2022-09-28 Nelvin Tan , Way Tan , Jonathan Scarlett

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

We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the population. Under the quantitative group testing model, the…

Information Theory · Computer Science 2017-10-24 Chao Wang , Qing Zhao , Chen-Nee Chuah

Group testing, a problem with diverse applications across multiple disciplines, traditionally assumes independence across nodes' states. Recent research, however, focuses on real-world scenarios that often involve correlations among nodes,…

Information Theory · Computer Science 2025-04-02 Hesam Nikpey , Saswati Sarkar , Shirin Saeedi Bidokhti

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 consider non-adaptive threshold group testing for identification of up to $d$ defective items in a set of $n$ items, where a test is positive if it contains at least $2 \leq u \leq d$ defective items, and negative otherwise. The…

Information Theory · Computer Science 2018-09-25 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

We consider the problem of determining feasible systems from a finite set of simulated alternatives with respect to probability constraints, where the observations from stochastic simulations are Bernoulli distributed. Most statistically…

Optimization and Control · Mathematics 2026-05-27 Taehoon Kim , Sigrun Andradottir , Seong-Hee Kim , Yuwei Zhou

Motivated by testing for pathogenic diseases we consider a new nonadaptive group testing problem for which: (1) positives occur within a burst, capturing the fact that infected test subjects often come in clusters, and (2) that the test…

Information Theory · Computer Science 2023-04-05 Yun-Han Li , Ryan Gabrys , Jin Sima , Ilan Shomorony , Olgica Milenkovic

Group testing enables to identify infected individuals in a population using a smaller number of tests than individual testing. To achieve this, group testing algorithms commonly assume knowledge of the number of infected individuals;…

Information Theory · Computer Science 2023-05-16 Chaorui Yao , Pavlos Nikolopoulos , Christina Fragouli