Improved group testing rates with constant column weight designs

We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance is improved compared to Bernoulli designs, where each item is placed in each test independently with a fixed probability. In particular, we show that the rate of the practical COMP detection algorithm is increased by 31% in all sparsity regimes. In dense cases, this beats the best possible algorithm with Bernoulli tests, and in sparse cases is the best proven performance of any practical algorithm. We also give an algorithm-independent upper bound for the constant column weight case; for dense cases this is again a 31% increase over the analogous Bernoulli result.

[1]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[2]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[3]  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).

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

[5]  Matthew Aldridge,et al.  The Capacity of Bernoulli Nonadaptive Group Testing , 2015, IEEE Transactions on Information Theory.

[6]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

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

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

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

[10]  Volkan Cevher,et al.  Phase Transitions in Group Testing , 2016, SODA.

[11]  Oliver Johnson,et al.  Strong converses for group testing in the finite blocklength regime , 2015, ArXiv.

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

[13]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[14]  Matthew Aldridge,et al.  Almost separable matrices , 2017, J. Comb. Optim..

[15]  Volkan Cevher,et al.  Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework , 2015, IEEE Transactions on Information Theory.

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

[17]  Tadashi Wadayama,et al.  An analysis on non-adaptive group testing based on sparse pooling graphs , 2013, 2013 IEEE International Symposium on Information Theory.

[18]  Matthew Aldridge,et al.  Group Testing Algorithms: Bounds and Simulations , 2013, IEEE Transactions on Information Theory.