English
Related papers

Related papers: On the All-Or-Nothing Behavior of Bernoulli Group …

200 papers

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

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

Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a "small" subset of $d$ defective items. In "classical" non-adaptive group testing, it is known that when…

Information Theory · Computer Science 2018-09-21 Venkata Gandikota , Elena Grigorescu , Sidharth Jaggi , Samson Zhou

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

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

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

In this work we study the fundamental limits of approximate recovery in the context of group testing. One of the most well-known, theoretically optimal, and easy to implement testing procedures is the non-adaptive Bernoulli group testing…

Statistics Theory · Mathematics 2021-07-30 Fotis Iliopoulos , Ilias Zadik

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

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

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

Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items into different pools and detecting defective members based…

Information Theory · Computer Science 2016-11-18 Mahdi Cheraghchi , Ali Hormati , Amin Karbasi , Martin Vetterli

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

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

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

The fundamental task of group testing is to recover a small distinguished subset of items from a large population while efficiently reducing the total number of tests (measurements). The key contribution of this paper is in adopting a new…

Information Theory · Computer Science 2015-03-13 George Kamal Atia , Venkatesh Saligrama

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 problem of classical group testing one aims to identify a small subset (of size $d$) diseased individuals/defective items in a large population (of size $n$). This process is based on a minimal number of suitably-designed group tests…

Information Theory · Computer Science 2022-09-26 Xiwei Cheng , Sidharth Jaggi , Qiaoqiao Zhou

In the classical non-adaptive group testing setup, pools of items are tested together, and the main goal of a recovery algorithm is to identify the "complete defective set" given the outcomes of different group tests. In contrast, the main…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy
‹ Prev 1 2 3 10 Next ›