Random and quasi-random designs in group testing

DOI10.1016/J.JSPI.2022.02.006MaRDI QIDQ2156803zbMATH OpenOpenAlexFDO

Authors Jack Noonan, A. Zhigljavsky

Publication date 20 July 2022

Published in Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.06130

zbMATH Keywords

asymptotic boundsdisjunct matricesfactor screeninggroup testingrandom designs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Design of statistical experiments (62K99)

Abstract: 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 randomization schemes. We also suggest and numerically justify a procedure of constructing designs with better separability properties than pure random designs. We illustrate theoretical considerations with a large simulation-based study. This study indicates, in particular, that in the case of the common binary group testing, the suggested families of designs have better separability than the popular designs constructed from disjunct matrices. We also derive several asymptotic expansions and discuss the situations when the resulting approximations achieve high accuracy.

Recommendations

• Randomized-sequential group testing procedures
• Existence theorems for some group testing strategies
• Some optimum non-adaptive hypergeometric group testing designs for identifying two defectives
• Non-adaptive group testing in the presence of errors
• scientific article; zbMATH DE number 933201

Cites work

• A coding model for a multiple-access adder channel
• A nonadaptive version of Ulam's problem with one lie
• A simple construction of \(d\)-disjunct matrices with certain constant weights
• A survey on nonadaptive group testing algorithms through the angle of decoding
• Bounds for packet transmission rate in a random-multiple-access system
• Determination of a Subset from Certain Combinatorial Properties
• Determination of two vectors from the sum
• Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
• Existence theorems for some group testing strategies
• Group Testing Algorithms: Bounds and Simulations
• Group Testing With Random Pools: Optimal Two-Stage Algorithms
• Group testing with random pools: Phase transitions and optimal strategy
• Group testing with unreliable tests
• Group testing: an information theory perspective
• scientific article; zbMATH DE number 3831842 (Why is no real title available?)
• scientific article; zbMATH DE number 4135867 (Why is no real title available?)
• scientific article; zbMATH DE number 4047604 (Why is no real title available?)
• scientific article; zbMATH DE number 3532378 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3248638 (Why is no real title available?)
• scientific article; zbMATH DE number 3194843 (Why is no real title available?)
• Information-Theoretic and Algorithmic Thresholds for Group Testing
• Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
• Minimal 2-coverings of a finite affine space based on GF(2)
• Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
• Nonadaptive group testing with lies: probabilistic existence theorems
• Optimizing Nonadaptive Group Tests for Objects with Heterogeneous Priors
• Phase transitions in group testing
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Probabilistic existence theorems in group testing
• Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening
• Search
• Searching with lies: The Ulam problem
• Simplified searching for two defects
• Theorems in the additive theory of numbers

Cited in

(4)

• Existence theorems for some group testing strategies
• Test design under voluntary participation
• Randomized-sequential group testing procedures
• Review of random and group-screening designs

This page was built for publication: Random and quasi-random designs in group testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156803)