English
Related papers

Related papers: Nested Group Testing Procedures for Screening

200 papers

Given $n$ items with at most $d$ of which being positive, instead of testing these items individually, the theory of combinatorial group testing aims to identify all positive items using as few tests as possible. This paper is devoted to a…

Information Theory · Computer Science 2016-10-26 Chong Shangguan , Gennian Ge

We consider two closely related problems: anomaly detection in sensor networks and testing for infections in human populations. In both problems, we have $n$ nodes (sensors, humans), and each node exhibits an event of interest (anomaly,…

Information Theory · Computer Science 2020-12-01 Melih Bastopcu , Sennur Ulukus

Permutation tests are a distribution free way of performing hypothesis tests. These tests rely on the condition that the observed data are exchangeable among the groups being tested under the null hypothesis. This assumption is easily…

Methodology · Statistics 2017-12-14 Daniell Toth

This paper proposes a new class of nonparametric tests for the correct specification of models based on conditional moment restrictions, paying particular attention to generalized propensity score models. The test procedure is based on two…

Econometrics · Economics 2023-04-18 Pedro H. C. Sant'Anna , Xiaojun Song

In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff…

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

For large classes of group testing problems, we derive lower bounds for the probability that all significant items are uniquely identified using specially constructed random designs. These bounds allow us to optimize parameters of the…

Statistics Theory · Mathematics 2022-02-17 Jack Noonan , Anatoly Zhigljavsky

In this note, we present a new adaptive algorithm for generalized group testing, which is asymptotically optimal if $d=o(\log_2|E|)$, $E$ is a set of potentially contaminated sets, $d$ is a maximal size of elements of $E$. Also, we design a…

Information Theory · Computer Science 2022-11-09 Ilya Vorobyev

The higher criticism of a family of tests starts with the individual uncorrected p-values of each test. It then requires a procedure for deciding whether the collection of p-values indicates the presence of a real effect and if possible…

We have a large number of samples and we want to find the infected ones using as few number of tests as possible. We can use group testing which tells about a small group of people whether at least one of them is infected. Group testing is…

Quantitative Methods · Quantitative Biology 2020-05-07 Endre Csóka

Group testing can help maintain a widespread testing program using fewer resources amid a pandemic. In a group testing setup, we are given n samples, one per individual. Each individual is either infected or uninfected. These samples are…

Signal Processing · Electrical Eng. & Systems 2023-07-19 Shu-Jie Cao , Ritesh Goenka , Chau-Wai Wong , Ajit Rajwade , Dror Baron

In this article, we consider the problem of simultaneous testing of hypotheses when the individual test statistics are not necessarily independent. Specifically, we consider the problem of simultaneous testing of point null hypotheses…

Statistics Theory · Mathematics 2018-07-17 Prasenjit Ghosh , Arijit Chakrabarti

The goal of group testing is to identify a small number of defective items within a large population. In the non-adaptive setting, tests are designed in advance and represented by a measurement matrix $\mM$, where rows correspond to tests…

Information Theory · Computer Science 2025-09-10 Trung-Khang Tran , Thach V. Bui

In general, randomness tests included in a test suite are not independent of each other. This renders it difficult to fix a rational criterion through the whole test suite with an explicit significance level. In this paper, we focus on the…

Statistics Theory · Mathematics 2019-08-21 Atsushi Iwasaki

The Neyman-Pearson (NP) binary classification paradigm constrains the more severe type of error (e.g., the type I error) under a preferred level while minimizing the other (e.g., the type II error). This paradigm is suitable for…

Methodology · Statistics 2022-06-07 Jingming Wang , Lucy Xia , Zhigang Bao , Xin Tong

In this paper, an exact bitwise MAP (Maximum A Posteriori) estimation algorithm for group testing problems is presented. We assume a simplest non-adaptive group testing scenario including N-objects with binary status and M-disjunctive…

Information Theory · Computer Science 2014-01-20 Tadashi Wadayama , Taisuke Izumi

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

In combinatorial group testing problems Questioner needs to find a defective element $x\in [n]$ by testing subsets of $[n]$. In [18] the authors introduced a new model, where each element knows the answer for those queries that contain it…

Discrete Mathematics · Computer Science 2017-05-25 Dániel Gerbner , Máté Vizer

As a common step in refining their scientific inquiry, investigators are often interested in performing some screening of a collection of given statistical hypotheses. For example, they may wish to determine whether any one of several…

Methodology · Statistics 2022-03-04 Adam Elder , Marco Carone , Peter Gilbert , Alex Luedtke

Consider the following Stochastic Score Classification Problem. A doctor is assessing a patient's risk of developing a certain disease, and can perform $n$ tests on the patient. Each test has a binary outcome, positive or negative. A…

Data Structures and Algorithms · Computer Science 2018-06-29 Dimitrios Gkenosis , Nathaniel Grammel , Lisa Hellerstein , Devorah Kletenik

We consider the problem of testing positively dependent multiple hypotheses assuming that a prior information about the dependence structure is available. We propose two-step multiple comparisons procedures that exploit the prior…