Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912118205317120 |
|---|---|
| author | Hintze, Lukas Krieg, Lena Scheftelowitsch, Olga Zhu, Haodong |
| author_facet | Hintze, Lukas Krieg, Lena Scheftelowitsch, Olga Zhu, Haodong |
| contents | 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 $α$, independent of all other items. In the (over-)idealized noiseless setting, tests are positive exactly if any of the tested items are defective. We study a more realistic model in which observed test results are subject to noise, i.e., tests can display false positive or false negative results with constant positive probabilities. We determine precise constants $c$ such that $cn\log n$ tests are required to recover the infection status of every individual for both adaptive and non-adaptive group testing: in the former, the selection of groups to test can depend on previously observed test results, whereas it cannot in the latter. Additionally, for both settings, we provide efficient algorithms that identify all defective items with the optimal amount of tests with high probability. Thus, we completely solve the problem of binary noisy group testing in the studied setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_03839 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms Hintze, Lukas Krieg, Lena Scheftelowitsch, Olga Zhu, Haodong Discrete Mathematics Information Theory Combinatorics 05C80, 62B10, 68P30, 68R05 F.2.2 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 $α$, independent of all other items. In the (over-)idealized noiseless setting, tests are positive exactly if any of the tested items are defective. We study a more realistic model in which observed test results are subject to noise, i.e., tests can display false positive or false negative results with constant positive probabilities. We determine precise constants $c$ such that $cn\log n$ tests are required to recover the infection status of every individual for both adaptive and non-adaptive group testing: in the former, the selection of groups to test can depend on previously observed test results, whereas it cannot in the latter. Additionally, for both settings, we provide efficient algorithms that identify all defective items with the optimal amount of tests with high probability. Thus, we completely solve the problem of binary noisy group testing in the studied setting. |
| title | Noisy Linear Group Testing: Exact Thresholds and Efficient Algorithms |
| topic | Discrete Mathematics Information Theory Combinatorics 05C80, 62B10, 68P30, 68R05 F.2.2 |
| url | https://arxiv.org/abs/2411.03839 |