English
Related papers

Related papers: Improved group testing rates with constant column …

200 papers

We consider the nonadaptive group testing with N items, of which $K = \Theta(N^\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests…

Information Theory · Computer Science 2018-09-26 Oliver Johnson , Matthew Aldridge , Jonathan Scarlett

We consider the problem of non-adaptive noiseless group testing of $N$ items of which $K$ are defective. We describe four detection algorithms: the COMP algorithm of Chan et al.; two new algorithms, DD and SCOMP, which require stronger…

Information Theory · Computer Science 2014-05-20 Matthew Aldridge , Leonardo Baldassini , Oliver Johnson

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 consider Bernoulli nonadaptive group testing with $k = \Theta(n^\theta)$ defectives, for $\theta \in (0,1)$. The practical definite defectives (DD) detection algorithm is known to be optimal for $\theta \geq 1/2$. We give a new upper…

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

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

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

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

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 any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett

In this paper, we study the problem of non-adaptive group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was…

Information Theory · Computer Science 2025-09-26 Lan V. Truong , Matthew Aldridge , Jonathan Scarlett

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

The group testing problem is concerned with identifying a small set of infected individuals in a large population. At our disposal is a testing procedure that allows us to test several individuals together. In an idealized setting, a test…

Information Theory · Computer Science 2023-09-19 Oliver Gebhard , Oliver Johnson , Philipp Loick , Maurice Rolvien

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

In a group testing scheme, a set of tests is designed to identify a small number $t$ of defective items that are present among a large number $N$ of items. Each test takes as input a group of items and produces a binary output indicating…

Information Theory · Computer Science 2016-11-17 Arya Mazumdar

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 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 2023-09-19 Jonathan Scarlett , Oliver Johnson

We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each…

Information Theory · Computer Science 2016-11-18 Chun Lam Chan , Sidharth Jaggi , Venkatesh Saligrama , Samar Agnihotri

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Combinatorics · Mathematics 2021-10-15 Bingchen Qian , Xin Wang , Gennian Ge

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

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

In this paper, we consider the problem of noiseless non-adaptive probabilistic group testing, in which the goal is high-probability recovery of the defective set. We show that in the case of $n$ items among which $k$ are defective, the…

Information Theory · Computer Science 2021-07-30 Wei Heng Bay , Eric Price , Jonathan Scarlett
‹ Prev 1 2 3 10 Next ›