Optimal Pooling Matrix Design for Group Testing with Dilution (Row Degree) Constraints
In this paper, we consider the problem of designing optimal pooling matrix for group testing (for example, for COVID-19 virus testing) with the constraint that no more than $r>0$ samples can be pooled together, which we call "dilution constraint". This problem translates to designing a matrix with elements being either 0 or 1 that has no more than $r$ '1's in each row and has a certain performance guarantee of identifying anomalous elements. We explicitly give pooling matrix designs that satisfy the dilution constraint and have performance guarantees of identifying anomalous elements, and prove their optimality in saving the largest number of tests, namely showing that the designed matrices have the largest width-to-height ratio among all constraint-satisfying 0-1 matrices..
| Medienart: |
|
|---|
Preprint| Erscheinungsjahr: |
2020 |
|---|---|
| Erschienen: |
2020 |
| Enthalten in: |
arXiv.org - (2020) vom: 05. Aug. Zur Gesamtaufnahme - year:2020 |
|---|
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Yi, Jirong [VerfasserIn] |
|---|
| Links: |
Volltext [kostenfrei] |
|---|
| Förderinstitution / Projekttitel: |
|
|---|
| PPN (Katalog-ID): |
XAR018508774 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | XAR018508774 | ||
| 003 | DE-627 | ||
| 005 | 20230429063131.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 200807s2020 xx |||||o 00| ||eng c | ||
| 035 | |a (DE-627)XAR018508774 | ||
| 035 | |a (arXiv)2008.01944 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | |a 000 |q DE-84 | |
| 082 | 0 | |a 620 |q DE-84 | |
| 082 | 0 | |a 510 |q DE-84 | |
| 082 | 0 | |a 570 |q DE-84 | |
| 082 | 0 | |a 510 |q DE-84 | |
| 100 | 1 | |a Yi, Jirong |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Optimal Pooling Matrix Design for Group Testing with Dilution (Row Degree) Constraints |
| 264 | 1 | |c 2020 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a In this paper, we consider the problem of designing optimal pooling matrix for group testing (for example, for COVID-19 virus testing) with the constraint that no more than $r>0$ samples can be pooled together, which we call "dilution constraint". This problem translates to designing a matrix with elements being either 0 or 1 that has no more than $r$ '1's in each row and has a certain performance guarantee of identifying anomalous elements. We explicitly give pooling matrix designs that satisfy the dilution constraint and have performance guarantees of identifying anomalous elements, and prove their optimality in saving the largest number of tests, namely showing that the designed matrices have the largest width-to-height ratio among all constraint-satisfying 0-1 matrices. | ||
| 700 | 1 | |a Cho, Myung |e verfasserin |4 aut | |
| 700 | 1 | |a Wu, Xiaodong |e verfasserin |4 aut | |
| 700 | 1 | |a Mudumbai, Raghu |e verfasserin |4 aut | |
| 700 | 1 | |a Xu, Weiyu |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t arXiv.org |g (2020) vom: 05. Aug. |
| 773 | 1 | 8 | |g year:2020 |g day:05 |g month:08 |
| 856 | 4 | 0 | |u https://arxiv.org/abs/2008.01944 |z kostenfrei |3 Volltext |
| 912 | |a GBV_XAR | ||
| 912 | |a SSG-OLC-PHA | ||
| 951 | |a AR | ||
| 952 | |j 2020 |b 05 |c 08 | ||
| 953 | |2 045F |a 000 | ||
| 953 | |2 045F |a 620 | ||
| 953 | |2 045F |a 510 | ||
| 953 | |2 045F |a 570 | ||
| 953 | |2 045F |a 510 | ||