Community-Aware Group Testing

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).

[1]  Ayfer Özgür,et al.  Adaptive Group Testing on Networks With Community Structure: The Stochastic Block Model , 2023, IEEE Transactions on Information Theory.

[2]  Sundara Rajan Srinivasavaradhan,et al.  Improving Group Testing via Gradient Descent , 2022, 2022 IEEE International Symposium on Information Theory (ISIT).

[3]  Suhas N. Diggavi,et al.  An entropy reduction approach to continual testing , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[4]  Christina Fragouli,et al.  Dynamic group testing to control and monitor disease progression in a population , 2021, 2022 IEEE International Symposium on Information Theory (ISIT).

[5]  S. Jaggi,et al.  Generalized Group Testing , 2021, IEEE Transactions on Information Theory.

[6]  S. Ulukus,et al.  Group Testing with a Graph Infection Spread Model , 2021, Inf..

[7]  Christina Fragouli,et al.  Group testing for overlapping communities , 2020, ICC 2021 - IEEE International Conference on Communications.

[8]  A. Jadbabaie,et al.  Network Group Testing , 2020, 2012.02847.

[9]  Chau-Wai Wong,et al.  Contact Tracing Enhances the Efficiency of Covid-19 Group Testing , 2020, ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[10]  João L. Ribeiro,et al.  AC-DC: Amplification Curve Diagnostics for Covid-19 Group Testing , 2020, 2011.05223.

[11]  Sarita Azad,et al.  Tracking the spread of COVID-19 in India via social networks in the early phase of the pandemic , 2020, Journal of travel medicine.

[12]  Christina Fragouli,et al.  Community aware group testing , 2020, ArXiv.

[13]  S. Mallapaty.  The mathematical strategy that could transform coronavirus testing , 2020, Nature.

[14]  Wei Heng Bay,et al.  Optimal Non-Adaptive Probabilistic Group Testing in General Sparsity Regimes , 2020, 2006.01325.

[15]  Carmela Troncoso,et al.  Decentralized Privacy-Preserving Proximity Tracing , 2020, IEEE Data Eng. Bull..

[16]  L. Kucirka,et al.  Variation in False-Negative Rate of Reverse Transcriptase Polymerase Chain Reaction–Based SARS-CoV-2 Tests by Time Since Exposure , 2020, Annals of Internal Medicine.

[17]  David S. Fischer,et al.  Group Testing for SARS-CoV-2 Allows for Up to 10-Fold Efficiency Increase Across Realistic Scenarios and Testing Strategies , 2020, Frontiers in Public Health.

[18]  Ajit Rajwade,et al.  Tapestry: A Single-Round Smart Pooling Technique for COVID-19 Testing , 2020, medRxiv.

[19]  Marco Cuturi,et al.  Noisy Adaptive Group Testing using Bayesian Sequential Experimental Design , 2020, ArXiv.

[20]  Royce J. Wilson,et al.  Google COVID-19 Community Mobility Reports: Anonymization Process Description (version 1.0) , 2020, ArXiv.

[21]  Junan Zhu,et al.  Noisy Pooled PCR for Virus Testing , 2020, bioRxiv.

[22]  Jonathan Scarlett,et al.  An Efficient Algorithm for Capacity-Approaching Noisy Adaptive Group Testing , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[23]  Matthew Aldridge,et al.  Group testing: an information theory perspective , 2019, Found. Trends Commun. Inf. Theory.

[24]  Yuji Matsuura,et al.  Non-adaptive group testing on graphs with connectivity , 2019, J. Comb. Optim..

[25]  Mary Wootters,et al.  Unconstraining graph-constrained group testing , 2018, APPROX-RANDOM.

[26]  Jonathan Scarlett,et al.  Noisy Adaptive Group Testing: Bounds and Algorithms , 2018, IEEE Transactions on Information Theory.

[27]  Matthew Aldridge,et al.  Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime , 2018, IEEE Transactions on Information Theory.

[28]  Sidharth Jaggi,et al.  Nearly optimal sparse group testing , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[29]  Paul S. Albert,et al.  Revisiting Nested Group Testing Procedures: New Results, Comparisons, and Robustness , 2016, The American statistician.

[30]  Oliver Johnson,et al.  Strong Converses for Group Testing From Finite Blocklength Results , 2015, IEEE Transactions on Information Theory.

[31]  Robert J. Piechocki,et al.  The capacity of non-identical adaptive group testing , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[32]  Wenhao Huang,et al.  Group testing with prior statistics , 2014, 2014 IEEE International Symposium on Information Theory.

[33]  Matthew Aldridge,et al.  The capacity of adaptive group testing , 2013, 2013 IEEE International Symposium on Information Theory.

[34]  Morteza Zadimoghaddam,et al.  Sequential group testing with graph constraints , 2012, 2012 IEEE Information Theory Workshop.

[35]  Venkatesh Saligrama,et al.  Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[36]  Dino Sejdinovic,et al.  Note on noisy group testing: Asymptotic bounds and belief propagation reconstruction , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[37]  George Atia,et al.  Noisy group testing: An information theoretic perspective , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[38]  M. Mézard,et al.  Group Testing with Random Pools: Phase Transitions and Optimal Strategy , 2007, 0711.2242.

[39]  B. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[40]  Charles J. Colbourn,et al.  SHARPER BOUNDS IN ADAPTIVE GROUP TESTING , 2000 .

[41]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[42]  K. Mullis,et al.  Enzymatic amplification of beta-globin genomic sequences and restriction site analysis for diagnosis of sickle cell anemia. , 1985, Science.

[43]  F. K. Hwang,et al.  A Boundary Problem for Group Testing , 1981 .

[44]  S D Walter,et al.  Estimation of infection rates in population of organisms using pools of variable size. , 1980, American journal of epidemiology.

[45]  Milton Sobel,et al.  Group testing with a new goal, estimation , 1975 .

[46]  F. Hwang.  A Method for Detecting all Defective Members in a Population by Group Testing , 1972 .

[47]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[48]  Milton Sobel,et al.  OPTIMAL GROUP TESTING. , 1964 .

[49]  P. Ungar.  The cutoff point for group testing , 1960 .

[50]  M. Sobel,et al.  Group testing to eliminate efficiently all defectives in a binomial sample , 1959 .

[51]  A. Sterrett.  On the Detection of Defective Members of Large Populations , 1957 .

[52]  Suhas N. Diggavi,et al.  Group testing for connected communities , 2021, AISTATS.