Random and quasi-random designs in group testing
From MaRDI portal
Publication:2156803
DOI10.1016/J.JSPI.2022.02.006zbMATH Open1497.62214arXiv2101.06130OpenAlexW4214926648MaRDI QIDQ2156803FDOQ2156803
Authors: Jack Noonan, A. Zhigljavsky 
Publication date: 20 July 2022
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2101.06130
Recommendations
Design of statistical experiments (62K99) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
- Title not available (Why is that?)
- Determination of a Subset from Certain Combinatorial Properties
- Theorems in the additive theory of numbers
- Group testing with unreliable tests
- Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening
- Group Testing With Random Pools: Optimal Two-Stage Algorithms
- Title not available (Why is that?)
- A simple construction of \(d\)-disjunct matrices with certain constant weights
- Error-correcting nonadaptive group testing with \(d^e\)-disjunct matrices
- Title not available (Why is that?)
- Search
- A survey on nonadaptive group testing algorithms through the angle of decoding
- A coding model for a multiple-access adder channel
- Probabilistic existence theorems in group testing
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
- Group Testing Algorithms: Bounds and Simulations
- Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms
- Phase transitions in group testing
- Minimal 2-coverings of a finite affine space based on GF(2)
- Determination of two vectors from the sum
- Searching with lies: The Ulam problem
- Title not available (Why is that?)
- Bounds for packet transmission rate in a random-multiple-access system
- Group testing: an information theory perspective
- Group testing with random pools: Phase transitions and optimal strategy
- Existence theorems for some group testing strategies
- Nonadaptive group testing with lies: probabilistic existence theorems
- Optimizing Nonadaptive Group Tests for Objects with Heterogeneous Priors
- A nonadaptive version of Ulam's problem with one lie
- Simplified searching for two defects
- Information-Theoretic and Algorithmic Thresholds for Group Testing
- Title not available (Why is that?)
Cited In (3)
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)
