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 条
  • [31] Group Testing Aggregate Signatures with Soundness
    Sato, Shingo
    Shikata, Junji
    Matsumoto, Tsutomu
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2022, 2023, 13849 : 363 - 381
  • [32] Optimal group testing with heterogeneous risks
    Bobkova, Nina
    Chen, Ying
    Eraslan, Hulya
    ECONOMIC THEORY, 2024, 77 (1-2) : 413 - 444
  • [33] Small Error Algorithms for Tropical Group Testing
    Paligadu, Vivekanand
    Johnson, Oliver
    Aldridge, Matthew
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2024, 70 (10) : 7232 - 7250
  • [34] Rates of Adaptive Group Testing in the Linear Regime
    Aldridge, Matthew
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 236 - 240
  • [35] An efficient algorithm for group testing with runlength constraints
    Dalai, Marco
    Della Fiore, Stefano
    Rescigno, Adele A.
    Vaccaro, Ugo
    DISCRETE APPLIED MATHEMATICS, 2025, 360 : 181 - 187
  • [36] Graph and Cluster Formation Based Group Testing
    Arasli, Batuhan
    Ulukus, Sennur
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 1236 - 1241
  • [37] Group Testing Schemes From Codes and Designs
    Barg, Alexander
    Mazumdar, Arya
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (11) : 7131 - 7141
  • [38] Statistical and Computational Phase Transitions in Group Testing
    Coja-Oghlan, Amin
    Gebhard, Oliver
    Hahn-Klimroth, Max
    Wein, Alexander S.
    Zadik, Ilias
    CONFERENCE ON LEARNING THEORY, VOL 178, 2022, 178
  • [39] Adaptive Graph-Constrained Group Testing
    Sihag, Saurabh
    Tajer, Ali
    Mitra, Urbashi
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2022, 70 : 381 - 396
  • [40] Upper and lower bounds for competitive group testing
    Scheidweiler, Robert
    Triesch, Eberhard
    DISCRETE APPLIED MATHEMATICS, 2023, 333 : 136 - 150