On the Generic Cut–Point Detection Procedure in the Binomial Group Testing

04/14/2023
by   Ugnė Čižikovienė, et al.
0

Initially announced by Dorfman in 1943, (Binomial) Group Testing (BGT) was quickly recognized as a useful tool in many other fields as well. To apply any particular BGT procedure effectively, one first of all needs to know an important operating characteristic, the so called Optimal Cut-Point (OCP), describing the limits of its applicability. The determination of the latter is often a complicated task. In this work, we provide a generic algorithm suitable for a wide class of the BGT procedures and demonstrate its applicability by example. The way we do it exhibits independent interest since we link the BGT to seemingly unrelated field – the bifurcation theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2022

On the Optimal Pairwise Group Testing Algorithm

Originally suggested for the blood testing problem by Dorfman in 1943, a...
research
04/26/2023

Cut-restriction: from cuts to analytic cuts

Cut-elimination is the bedrock of proof theory with a multitude of appli...
research
09/15/2023

On the Asymptotics of Graph Cut Objectives for Experimental Designs of Network A/B Testing

A/B testing is an effective way to assess the potential impacts of two t...
research
07/10/2023

Retrieval of phonemes and Kohonen algorithm

A phoneme-retrieval technique is proposed, which is due to the particula...
research
01/21/2022

ANOVA for Data in Metric Spaces, with Applications to Spatial Point Patterns

We give a review of recent ANOVA-like procedures for testing group diffe...
research
02/27/2018

Follow Up on Detecting Deficiencies: An Optimal Group Testing Algorithm

In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) t...

Please sign up or login with your details

Forgot password? Click here to reset