Optimal non-adaptive probabilistic group testing in general sparsity regimes

DOI10.1093/IMAIAI/IAAB020MaRDI QIDQ5044117zbMATH OpenOpenAlexFDO

Authors Wei Heng Bay, Jonathan Scarlett, Eric Price

Publication date 24 October 2022

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

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

zbMATH Keywords

group testinginformation-theoretic limitssparsity

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Randomized algorithms (68W20)

Recommendations

• When is individual testing optimal for nonadaptive group testing?
• Phase transitions in group testing
• Sharper bounds in adpative group testing
• Bounds for the number of tests in non-adaptive randomized algorithms for group testing
• Randomized group testing both query-optimal and minimal adaptive

Cited in

(6)

• A recovery algorithm and pooling designs for one-stage noisy group testing under the probabilistic framework
• Optimizing Nonadaptive Group Tests for Objects with Heterogeneous Priors
• Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms
• Nonadaptive Group Testing Based on Sparse Pooling Graphs
• Optimal Non-Adaptive Probabilistic Group Testing in General Sparsity Regimes
• Approximate message passing with rigorous guarantees for pooled data and quantitative group testing

This page was built for publication: Optimal non-adaptive probabilistic group testing in general sparsity regimes

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