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 条
  • [41] Group testing in graphs
    Juan, Justie Su-Tzu
    Chang, Gerard J.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (2-3) : 113 - 119
  • [42] Group Testing Game
    Bolouki, Sadegh
    Manshaei, Mohammad Hossein
    Ravanmehr, Vida
    Nedic, Angelia
    Basar, Tamer
    IFAC PAPERSONLINE, 2017, 50 (01): : 9668 - 9673
  • [43] Group Testing on a Network
    Silva, Arlei
    Singh, Ambuj
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 4348 - 4356
  • [44] Secure Group Testing
    Cohen, Alejandro
    Cohen, Asaf
    Gurewitz, Omer
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 : 4003 - 4018
  • [45] Near-Optimal Sparse Adaptive Group Testing
    Tan, Nelvin
    Scarlett, Jonathan
    2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 1420 - 1425
  • [46] Nonadaptive Group Testing Based on Sparse Pooling Graphs
    Wadayama, Tadashi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (03) : 1525 - 1534
  • [47] Group testing in graphs
    Justie Su-tzu Juan
    Gerard J. Chang
    Journal of Combinatorial Optimization, 2007, 14 : 113 - 119
  • [48] On the optimal configuration of a square array group testing algorithm
    Cizikoviene, Ugne
    Skorniakov, Viktor
    STATISTICS AND ITS INTERFACE, 2023, 16 (01) : 579 - 591
  • [49] Generalized framework for Group Testing: Queries, feedbacks and adversaries
    Klonowski, Marek
    Kowalski, Dariusz R.
    Pajak, Dominik
    THEORETICAL COMPUTER SCIENCE, 2022, 919 : 18 - 35
  • [50] A Zig-Zag Approach for Competitive Group Testing
    Cheng, Yongxi
    Du, Ding-Zhu
    Xu, Yinfeng
    INFORMS JOURNAL ON COMPUTING, 2014, 26 (04) : 677 - 689