English
Related papers

Related papers: Bounds for the Number of Tests in Non-Adaptive Ran…

200 papers

Random testing approaches work by generating inputs at random, or by selecting inputs randomly from some pre-defined operational profile. One long-standing question that arises in this and other testing contexts is as follows: When can we…

Software Engineering · Computer Science 2024-06-25 Neil Walkinshaw , Michael Foster , Jose Miguel Rojas , Robert M Hierons

The 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$. A test is positive if it has at least $u$ defective items and negative otherwise. Our…

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

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 study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p<<1, and large number of variables, N>>1, taking either p->0 after…

Data Structures and Algorithms · Computer Science 2007-11-14 Marc Mezard , Cristina Toninelli

In the group testing problem the aim is to identify a small set of $k\sim n^\theta$ infected individuals out of a population size $n$, $0<\theta<1$. We avail ourselves of a test procedure capable of testing groups of individuals, with the…

Discrete Mathematics · Computer Science 2021-05-14 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Philipp Loick

Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a "small" number of "pooled" tests. For ease of presentation in this work we focus on the…

Information Theory · Computer Science 2013-07-11 Sheng Cai , Mohammad Jahangoshahi , Mayank Bakshi , Sidharth Jaggi

We consider a version of the classical group testing problem motivated by PCR testing for COVID-19. In the so-called tropical group testing model, the outcome of a test is the lowest cycle threshold (Ct) level of the individuals pooled…

Information Theory · Computer Science 2024-10-15 Vivekanand Paligadu , Oliver Johnson , Matthew Aldridge

The goal of non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many…

Information Theory · Computer Science 2018-03-19 Thach V. Bui , Tetsuya Kojima , Minoru Kuribayashi , Isao Echizen

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

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

We study the problem usually referred to as group testing in the context of COVID-19. Given $n$ samples taken from patients, how should we select mixtures of samples to be tested, so as to maximize information and minimize the number of…

Methodology · Statistics 2020-05-14 Louis Abraham , Gary Bécigneul , Bernhard Schölkopf

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

We consider nonadaptive probabilistic group testing in the linear regime, where each of n items is defective independently with probability p in (0,1), and p is a constant independent of n. We show that testing each item individually is…

Information Theory · Computer Science 2025-09-26 Matthew Aldridge

We consider the problem of non-adaptive group testing of $N$ items out of which $K$ or less items are known to be defective. We propose a testing scheme based on left-and-right-regular sparse-graph codes and a simple iterative decoder. We…

Information Theory · Computer Science 2017-01-27 Avinash Vem , Nagaraj T. Janakiraman , Krishna R. Narayanan

The group testing problem consists of determining a sparse subset of defective items from within a larger set of items via a series of tests, where each test outcome indicates whether at least one defective item is included in the test. We…

Information Theory · Computer Science 2026-04-24 Daniel McMorrow , Jonathan Scarlett

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 problem of Group Testing is to identify defective items out of a set of objects by means of pool queries of the form "Does the pool contain at least a defective?". The aim is of course to perform detection with the fewest possible…

Statistical Mechanics · Physics 2009-11-13 M. Mézard , M. Tarzia , C. Toninelli

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

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

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