Adaptive Graph-Constrained Group Testing
Adaptive Graph-Constrained Group Testing
复制标题
DOI:
10.1109/tsp.2021.3137026
复制
发表时间:
2022-01-01
影响因子:
5.4
通讯作者:
Mitra,Urbashi
中科院分区:
文献类型:
--
作者:
Sihag,Saurabh;Tajer,Ali;Mitra,Urbashi
This paper considers the problem of adaptive group testing for isolating up todefective items from a population of size. There exist restrictions or preferences which determine how the items can be pooled for testing. A graphical model formalizes the pooling restrictions and preferences. Such graph-constrained group testing is investigated in three settings: populations with defectives, populations facing the potential presence of inhibitors, and populations with community structures. Adaptive group testing frameworks are provided for each setting. In populations without inhibitors, existing non adaptive frameworks can isolate the defective items perfectly withnumber of tests, where is the-mixing time of a random walk over the underlying graph. This paper provides a two-stage framework that can perfectly isolate up todefective items for a regular graph usingnumber of tests, thus achieving an approximate gain of a factor ofover the non-adaptive frameworks. This twostage framework's principles are extended to community-structured graphs and graphs with up toinhibitor items. In particular, when inhibitors are present in the graph, a four-stage group testing framework is proposed. The results show that in the regimefor a fully connected graph,tests are sufficient for isolating the defective items. This matches the corresponding necessary condition on tests which scales. The adaptive graphconstrained group testing framework is also empirically evaluated.