Hostname: page-component-77f85d65b8-8v9h9 Total loading time: 0 Render date: 2026-04-18T10:41:08.804Z Has data issue: false hasContentIssue false

A negative binomial approximation in group testing

Published online by Cambridge University Press:  28 October 2022

Letian Yu
Affiliation:
Department of System Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin NT, Hong Kong. E-mail: letian.yu@link.cuhk.edu.hk
Fraser Daly
Affiliation:
Department of Actuarial Mathematics and Statistics, Heriot–Watt University, Edinburgh EH14 4AS, UK. E-mail: f.daly@hw.ac.uk
Oliver Johnson
Affiliation:
School of Mathematics, University of Bristol, Fry Building, Woodland Road, Bristol BS8 1UG, UK. E-mail: o.johnson@bristol.ac.uk

Abstract

We consider the problem of group testing (pooled testing), first introduced by Dorfman. For nonadaptive testing strategies, we refer to a nondefective item as “intruding” if it only appears in positive tests. Such items cause misclassification errors in the well-known COMP algorithm and can make other algorithms produce an error. It is therefore of interest to understand the distribution of the number of intruding items. We show that, under Bernoulli matrix designs, this distribution is well approximated in a variety of senses by a negative binomial distribution, allowing us to understand the performance of the two-stage conservative group testing algorithm of Aldridge.

Information

Type
Research Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable