Community-Aware Group Testing

被引:2
|
作者
Nikolopoulos, Pavlos [1 ]
Srinivasavaradhan, Sundara Rajan [2 ]
Guo, Tao [2 ]
Fragouli, Christina [2 ]
Diggavi, Suhas N. N. [2 ]
机构
[1] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
[2] Univ Calif Los Angeles, Dept Elect & Comp Engn, Los Angeles, CA 90095 USA
关键词
Coding; group testing; DEFECTIVE MEMBERS; GRAPHS; BOUNDS; POOLS;
D O I
10.1109/TIT.2023.3250119
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing has typically assumed independent infections. However, contagious diseases among humans, like SARS-CoV-2, have an important characteristic: infections are governed by community spread, and are therefore correlated. In this paper, we explore this observation and we argue that taking into account the community structure when testing can lead to significant savings in terms of the number of tests required to guarantee a given identification accuracy. To show that, we start with a simplistic (yet practical) infection model, where the entire population is organized in (possibly overlapping) communities and the infection probability of an individual depends on the communities (s)he participates in. Given this model, we compute new lower bounds on the number of tests for zero-error identification and design community-aware group testing algorithms that can be optimal under assumptions. Finally, we demonstrate significant benefits over traditional, community-agnostic group testing via simulations using both noiseless and noisy tests. Shorter versions of this article, which contained a subset of the material, were presented in the work by Nikolopoulos et al. (2021, 2021).
引用
收藏
页码:4361 / 4383
页数:23
相关论文
共 50 条
  • [21] Dynamic SAFFRON: Disease Control Over Time via Group Testing
    Arasli, Batuhan
    Ulukus, Sennur
    ALGORITHMS, 2022, 15 (11)
  • [22] Fast splitting algorithms for sparsity-constrained and noisy group testing
    Price, Eric
    Scarlett, Jonathan
    Tan, Nelvin
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2023, 12 (02) : 1141 - 1171
  • [23] Nearly Optimal Sparse Group Testing
    Gandikota, Venkata
    Grigorescu, Elena
    Jaggi, Sidharth
    Zhou, Samson
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 2760 - 2773
  • [24] Sequential Group Testing with Graph Constraints
    Karbasi, Amin
    Zadimoghaddam, Morteza
    2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 292 - 296
  • [25] A negative binomial approximation in group testing
    Yu, Letian
    Daly, Fraser
    Johnson, Oliver
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2023, 37 (04) : 973 - 996
  • [26] Quaternary splitting algorithm in group testing
    Lu, Jinn
    Fu, Hung-Lin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (01) : 73 - 79
  • [27] Optimal non-adaptive probabilistic group testing in general sparsity regimes
    Bay, Wei Heng
    Scarlett, Jonathan
    Price, Eric
    INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2022, 11 (03) : 1037 - 1053
  • [28] Sequential estimation in the group testing problem
    Haber, Gregory
    Malinovsky, Yaakov
    Albert, Paul S.
    SEQUENTIAL ANALYSIS-DESIGN METHODS AND APPLICATIONS, 2018, 37 (01): : 1 - 17
  • [29] Group Testing: An Information Theory Perspective
    Aldridge, Matthew
    Johnson, Oliver
    Scarlett, Jonathan
    FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY, 2019, 15 (3-4): : 196 - 392
  • [30] Performance of Group Testing Algorithms With Near-Constant Tests Per Item
    Johnson, Oliver
    Aldridge, Matthew
    Scarlett, Jonathan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (02) : 707 - 723