activity
20012022
most citedGroup testing algorithms: bounds and simulations

156 citations · 1.4k across the 61 of their papers we have counts for

collaborators
Showing math.PRShow all

25 papers · 1 filter

math.PR2022★ 1 cited

A negative binomial approximation in group testing

Letian Yu, Fraser Daly, Oliver Johnson

We consider the problem of group testing (pooled testing), first introduced by Dorfman. For non-adaptive testing strategies, we refer to a non-defective item as `intruding' if it o…

math.PR2018★ 7 cited

A proof of the Shepp-Olkin entropy monotonicity conjecture

Erwan Hillion, Oliver Johnson

Consider tossing a collection of coins, each fair or biased towards heads, and take the distribution of the total number of heads that result. It is natural to conjecture that this…

math.PR2018★ 1 cited

An extremal property of the normal distribution, with a discrete analog

Erwan Hillion, Oliver Johnson, Adrien Saumard

We prove, using the Brascamp-Lieb inequality, that the Gaussian measure is the only strong log-concave measure having a strong log-concavity parameter equal to its covariance matri…

math.PR2017★ 2 cited

Relaxation of monotone coupling conditions: Poisson approximation and beyond

Fraser Daly, Oliver Johnson

It is well-known that assumptions of monotonicity in size-bias couplings may be used to prove simple, yet powerful, Poisson approximation results. Here we show how these assumption…

math.PR2016★ 5 cited

Thinning and Information Projections

Peter Harremoës, Oliver Johnson, Ioannis Kontoyiannis

In this paper we establish lower bounds on information divergence of a distribution on the integers from a Poisson distribution. These lower bounds are tight and in the cases where…

math.PR2015★ 2 cited

Entropy and thinning of discrete random variables

Oliver Johnson

We describe five types of results concerning information and concentration of discrete random variables, and relationships between them, motivated by their counterparts in the cont…