<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article">
 <front>
  <journal-meta>
   <journal-id journal-id-type="publisher-id">
    ojs
   </journal-id>
   <journal-title-group>
    <journal-title>
     Open Journal of Statistics
    </journal-title>
   </journal-title-group>
   <issn pub-type="epub">
    2161-718X
   </issn>
   <issn publication-format="print">
    2161-7198
   </issn>
   <publisher>
    <publisher-name>
     Scientific Research Publishing
    </publisher-name>
   </publisher>
  </journal-meta>
  <article-meta>
   <article-id pub-id-type="doi">
    10.4236/ojs.2025.153017
   </article-id>
   <article-id pub-id-type="publisher-id">
    ojs-143708
   </article-id>
   <article-categories>
    <subj-group subj-group-type="heading">
     <subject>
      Articles
     </subject>
    </subj-group>
    <subj-group subj-group-type="Discipline-v2">
     <subject>
      Physics 
     </subject>
     <subject>
       Mathematics
     </subject>
    </subj-group>
   </article-categories>
   <title-group>
    Bayesian Interval Estimation of the Prevalence Rate Using Pool Testing Strategy with Retesting
   </title-group>
   <contrib-group>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Velmah
      </surname>
      <given-names>
       Kiprop
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Matiri George
      </surname>
      <given-names>
       Munene
      </given-names>
     </name>
    </contrib>
    <contrib contrib-type="author" xlink:type="simple">
     <name name-style="western">
      <surname>
       Luke Akongo
      </surname>
      <given-names>
       Orawo
      </given-names>
     </name>
    </contrib>
   </contrib-group> 
   <aff id="affnull">
    <addr-line>
     aMathematics Department, Egerton University, Njoro Nakuru, Kenya
    </addr-line> 
   </aff> 
   <pub-date pub-type="epub">
    <day>
     09
    </day> 
    <month>
     06
    </month>
    <year>
     2025
    </year>
   </pub-date> 
   <volume>
    15
   </volume> 
   <issue>
    03
   </issue>
   <fpage>
    323
   </fpage>
   <lpage>
    336
   </lpage>
   <history>
    <date date-type="received">
     <day>
      12,
     </day>
     <month>
      May
     </month>
     <year>
      2025
     </year>
    </date>
    <date date-type="published">
     <day>
      27,
     </day>
     <month>
      May
     </month>
     <year>
      2025
     </year> 
    </date> 
    <date date-type="accepted">
     <day>
      27,
     </day>
     <month>
      June
     </month>
     <year>
      2025
     </year> 
    </date>
   </history>
   <permissions>
    <copyright-statement>
     © Copyright 2014 by authors and Scientific Research Publishing Inc. 
    </copyright-statement>
    <copyright-year>
     2014
    </copyright-year>
    <license>
     <license-p>
      This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/
     </license-p>
    </license>
   </permissions>
   <abstract>
    Accurate estimation of disease prevalence is crucial for effective public health intervention and resource allocation. Generating data by individual testing methods is often impractical and expensive for large populations, particularly when disease prevalence is low. Pool testing involves combining samples from multiple individuals into a pool and performing a single test, and offers a cost-effective and efficient alternative. In pool testing strategy with retesting, if a pool tests negative, it is classified as non-defective, whereas if it is positive, then a retest is needed. The retesting strategy mitigates the effects of initial test errors, thereby enhancing the accuracy of the estimation of the prevalence rate. Evidence in the literature indicates that the traditional Wald method has been used to construct approximate confidence intervals for the prevalence rate. However, this interval estimation method is based on the normality approximation and hence may not be accurate when the true prevalence rate is close to zero. In this paper, we propose a Bayesian interval estimation approach which is not affected by extreme values of the prevalence rate and allows for incorporating prior information about the prevalence rate. We assumed that the prior distribution for the unknown prevalence rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
      p
     </mi> 
    </math> is a Beta distribution with parameters 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
        α
       </mi> 
       <mn>
        0
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
        β
       </mi> 
       <mn>
        0
       </mn> 
      </msub> 
     </mrow> 
    </math> and based on pool testing outcomes for the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
      n
     </mi> 
    </math> pools each of size 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
      k
     </mi> 
    </math> , 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mn>
       100
      </mn>
      <mrow>
       <mo>
        (
       </mo> 
       <mrow> 
        <mn>
         1
        </mn>
        <mo>
         −
        </mo>
        <mi>
         α
        </mi>
       </mrow> 
       <mo>
        )
       </mo>
      </mrow>
      <mi>
       %
      </mi>
     </mrow> 
    </math> credible intervals were constructed from the resulting posterior distribution. Simulation studies were carried out to compare the efficiencies of the Bayesian and Wald interval estimation methods for various values of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
      p
     </mi> 
    </math> .
   </abstract>
   <kwd-group> 
    <kwd>
     Pool Testing
    </kwd> 
    <kwd>
      Specificity
    </kwd> 
    <kwd>
      Sensitivity
    </kwd> 
    <kwd>
      Trinomial Distribution
    </kwd> 
    <kwd>
      Posterior Distribution
    </kwd> 
    <kwd>
      Gridding Method
    </kwd> 
    <kwd>
      Credible Intervals
    </kwd> 
    <kwd>
      Coverage Probability
    </kwd>
   </kwd-group>
  </article-meta>
 </front>
 <body>
  <sec id="s1">
   <title>1. Introduction</title>
   <p>Estimating disease prevalence is among the significant activities in the conduct of epidemiological studies. One has to note that traditional individual testing can be very costly, and in most cases requires a lot of time and resources especially when it is carried out on large samples. The pool testing technique, which began with Dorfman <xref ref-type="bibr" rid="scirp.143708-1">
     [1]
    </xref>, provides an alternative economical way of testing clinical samples and involves putting several clinical samples into a pool or group to be tested in a diagnostic test. In addition, pool testing is also ideal when the population has a low disease prevalence rate. Pool testing with retesting consists of testing a pool, and if the pool tests positive, the pool is tested again. When a pool tests positive on the retest, individual members of that pool are tested and the pool is categorized as either defective or non-defective. These aids in reducing the loss of sensitivity which may be evident in pool testing. It has been demonstrated that the use of pool testing techniques with retesting decreases the number of misclassifications, secondly it increases the efficiency of the testing kit and thirdly it increases the efficiency of the estimator of the prevalence rate <xref ref-type="bibr" rid="scirp.143708-2">
     [2]
    </xref> <xref ref-type="bibr" rid="scirp.143708-3">
     [3]
    </xref>. Nyongesa <xref ref-type="bibr" rid="scirp.143708-4">
     [4]
    </xref> considered a single-stage pool design to estimate the prevalence of a disease in the presence of inspection errors. He investigated the effects of specificity and sensitivity, and sample size on the efficiency of the estimator of the prevalence rate and found that the estimator is more efficient for large sample sizes and low specificity and sensitivity.</p>
   <p>Bayesian techniques have been applied in many epidemiological settings, such as disease monitoring, outbreak simulation, and prevalence quantification. For instance, McDonald and Hodson <xref ref-type="bibr" rid="scirp.143708-5">
     [5]
    </xref> applied Bayesian techniques to predict disease prevalence based on tests that are not perfect, and their study showed that this approach has superior efficiency to the other methods in the same context.</p>
   <p>The Bayesian approach to prevalence rate estimation incorporates the prior information about the prevalence rate and combines it with the data collected to estimate the prevalence rate. To do this, one has to assign a prior distribution to the prevalence rate, form the likelihood of the prevalence rate based on the observed data and then apply the Bayes’ Theorem to obtain the posterior distribution of the prevalence rate. The estimation of the prevalence rate is based on the posterior distribution. Bayesian method has been used in the estimation of the prevalence rate in group testing as explained by Liu and Liu <xref ref-type="bibr" rid="scirp.143708-6">
     [6]
    </xref>. The study focused on describing Bayesian interval estimation using Beta priors and binomial likelihoods; the study also showed the superiority of using Bayesian credible intervals in the group testing paradigm. Indeed, the authors explained how the addition of prior information could enhance estimation, especially where the prevalence was low.</p>
   <p>Spiegelhalter and Best <xref ref-type="bibr" rid="scirp.143708-7">
     [7]
    </xref> wrote about the object of applying Bayesian methods to complex models in epidemiology, with the self-note that Bayesian credible intervals are suitable for the modeling of the costs and effects in the cost effectiveness analysis. They demonstrated how even with all the different approaches to evidence and uncertainty EA is a powerful tool that can be utilized for decision-making in the field of public health. Gelman et al. <xref ref-type="bibr" rid="scirp.143708-8">
     [8]
    </xref> describe the general Bayesian approach to statistical data analysis and for single parameter models such as the binomial distribution, they give illustrative practical examples of the construction and interpretation of Bayesian credible intervals for the unknown parameter of interest.</p>
   <p>In the study done by Brett, Rohani, and Drake <xref ref-type="bibr" rid="scirp.143708-9">
     [9]
    </xref>, bayesian methods of prediction of epidemic transitions with observational data of less accuracy were used. To measure the uncertainty of the estimates of some important epidemiological parameters, they used Bayesian credible intervals and pointed out that intervals of this kind are rather robust to data uncertainty and model misspecification.</p>
   <p>Orawo <xref ref-type="bibr" rid="scirp.143708-10">
     [10]
    </xref> compared four interval estimation methods for the construction of the interval estimate of the binomial proportion: These include, the Wilson, Clopper-Pearson, likelihood and Wald confidence intervals. The analysis of the study, via simulation, established that the Clopper-Pearson interval was a conservative interval both for small and big samples and, on the other hand, the Wald confidence interval had coverage probabilities lower than the nominal level and had the problem of overshoot. The Wilson and likelihood intervals are relatively close in terms of coverage probabilities near the nominal level, with the likelihood interval also being slightly shorter.</p>
   <p>Hepworth <xref ref-type="bibr" rid="scirp.143708-11">
     [11]
    </xref> compared four confidence interval methods of estimating the proportion of positively classified units when the number of patterns in each group is different and the sample is very large. He stated that these methods should be compared to the exact likelihood ratio, which is preferable to the precise method. However, Biggerstaff <xref ref-type="bibr" rid="scirp.143708-12">
     [12]
    </xref> pointed out the confidence interval method for the difference of two proportions based on the pooled sample.</p>
   <p>The applicability of Bayesian statistical methods in interval estimation of prevalence rate through pool testing with retesting strategy has remained relatively uncharted. The traditional Wald method has been applied in constructing the confidence interval for the prevalence rate based on data generated by different pool testing designs; however, it is not accurate when the normal approximation to the binomial is poor. This is expected to occur since the prevalence rate is low and is close to zero. Other intervals such as Clopper-Pearson and Wilson intervals for a proportion, are restricted to binomial sampling and thus are not possible to compute in a complex trinomial probability model, resulting from a pool testing with retesting, whose probabilities involve the prevalence rate. This paper considers the numerical construction of Bayesian credible intervals and compares them with the Wald confidence intervals on the basis of coverage probabilities and mean interval lengths based on simulated data.</p>
   <p>The paper is organized as follows: Section 2 describes the pool testing with retesting design. In section 3, the trinomial probability model is derived from the retesting design. The Bayes credible intervals and Wald confidence intervals are outlined in section 4. In section 5, the simulation results on the coverage probability and mean interval length of the interval estimates, generated by the two methods, are presented. Section 6 is devoted to concluding remarks.</p>
  </sec><sec id="s2">
   <title>2. The Retesting Design</title>
   <p>Suppose that a population of the size 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       N 
     </mi> 
    </math> is divided into 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> groups each of size 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math>. Each of the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> pools is subjected to an initial test. Pools that test positive are retested. On the other hand, further testing is discontinued for pools that test negative. If a pool tests positive on re-testing, its constituent members are tested individually for the presence of characteristics of interest. Retesting is considered to improve the sensitivity and specificity of the testing scheme. It has also been proved that retesting reduces misclassification significantly compared to the Dorfman procedure and enhances the efficiency of the testing kit.</p>
   <p>
    <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref> illustrates the process of pool testing with retesting.</p>
   <p>The figure shows the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> constructed groups and the test result on the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         i 
       </mi> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          h 
        </mi> 
       </mrow> 
      </msup> 
     </mrow> 
    </math> group, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        i 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        1 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        2 
      </mn> 
      <mo>
        , 
      </mo> 
      <mo>
        ⋯ 
      </mo> 
      <mo>
        , 
      </mo> 
      <mi>
        n 
      </mi> 
     </mrow> 
    </math>.</p>
   <fig id="fig1" position="float">
    <label>Figure 1</label>
    <caption>
     <title>Figure 1. Pool testing with retesting design.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId43.jpeg?20250630035034" />
   </fig>
   <p>The following indicator functions was used to classify the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> binary observations generated by the pool testing with the retesting procedure</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         T 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mn>
            1 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            if 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             i 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            pool 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            positive 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            on 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            kit 
          </mtext> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mn>
            0 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            otherwise 
          </mtext> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msubsup> 
       <mi>
         T 
       </mi> 
       <mi>
         i 
       </mi> 
       <mn>
         1 
       </mn> 
      </msubsup> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mn>
            1 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            if 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             i 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            pool 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            positive 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            on 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            retest 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            on 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            kit 
          </mtext> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mn>
            0 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            otherwise 
          </mtext> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mo> 
      </mo> 
      <msub> 
       <mi>
         D 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mn>
            1 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            if 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             i 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            pool 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            is 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            positive 
          </mtext> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mn>
            0 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            otherwise 
          </mtext> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         T 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mn>
            1 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            if 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             j 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            individual 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            in 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            an 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             i 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            pool 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            positive 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            on 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            test 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            kit 
          </mtext> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mn>
            0 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            otherwise 
          </mtext> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>and</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         δ 
       </mi> 
       <mrow> 
        <mi>
          i 
        </mi> 
        <mi>
          j 
        </mi> 
       </mrow> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mo>
         { 
       </mo> 
       <mtable columnalign="left"> 
        <mtr> 
         <mtd> 
          <mn>
            1 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            if 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             j 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            individual 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            in 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            the 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msup> 
           <mi>
             i 
           </mi> 
           <mrow> 
            <mi>
              t 
            </mi> 
            <mi>
              h 
            </mi> 
           </mrow> 
          </msup> 
          <mtext>
              
          </mtext> 
          <mtext>
            group 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            is 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            positive 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            with 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            probability 
          </mtext> 
          <mtext>
              
          </mtext> 
          <mi>
            p 
          </mi> 
         </mtd> 
        </mtr> 
        <mtr> 
         <mtd> 
          <mn>
            0 
          </mn> 
          <mo>
            ; 
          </mo> 
          <mtext>
              
          </mtext> 
          <mtext>
              
          </mtext> 
          <mtext>
            otherwise 
          </mtext> 
         </mtd> 
        </mtr> 
       </mtable> 
      </mrow> 
     </mrow> 
    </math></p>
   <p>The observations of the constituent members of the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         i 
       </mi> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          h 
        </mi> 
       </mrow> 
      </msup> 
     </mrow> 
    </math> Group was denoted by 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mn>
            2 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. By definition,</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mn>
            1 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mn>
            2 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
        <mo>
          , 
        </mo> 
        <mo>
          ⋯ 
        </mo> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           δ 
         </mi> 
         <mrow> 
          <mi>
            i 
          </mi> 
          <mi>
            k 
          </mi> 
         </mrow> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>.</p>
   <p>Suppose that the constituent members of a group are assumed to act independently of each other; then.</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        P 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           D 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            p 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mi>
         k 
       </mi> 
      </msup> 
     </mrow> 
    </math>, where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> is the prevalence rate.</p>
  </sec><sec id="s3">
   <title>3. The Model Formation</title>
   <p>Let the random variables 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> denote the number of groups that test positive and negative on the initial test, respectively. Also, denote by 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mrow> 
        <mn>
          12 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> the number of groups that test positive and negative on the retest, respectively. Utilizing the indicator functions 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         T 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msubsup> 
       <mi>
         T 
       </mi> 
       <mi>
         i 
       </mi> 
       <mn>
         1 
       </mn> 
      </msubsup> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         D 
       </mi> 
       <mi>
         i 
       </mi> 
      </msub> 
     </mrow> 
    </math> and <xref ref-type="fig" rid="fig1">
     Figure 1
    </xref>, the probability of declaring the 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msup> 
       <mi>
         i 
       </mi> 
       <mrow> 
        <mi>
          t 
        </mi> 
        <mi>
          h 
        </mi> 
       </mrow> 
      </msup> 
     </mrow> 
    </math> pool negative on the initial test 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        p 
      </mi> 
      <mi>
        r 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is derived as follows. By the law of total probability</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            or 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <msup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </msup> 
        <mi>
          β 
        </mi> 
        <mo>
          + 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mn>
                1 
              </mn> 
              <mo>
                − 
              </mo> 
              <mi>
                p 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mi>
             k 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            η 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math></p>
   <p>where 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       η 
     </mi> 
    </math> is the sensitivity (the probability of correctly classifying a defective pool), and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       β 
     </mi> 
    </math> is the specificity (the probability of correctly classifying a non-defective pool).</p>
   <p>Similarly, the probability of declaring a pool as negative on retesting pool that is initially classified as positive is given by; 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        = 
      </mo> 
      <mi>
        p 
      </mi> 
      <mi>
        r 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mn>
          1 
        </mn> 
        <mo>
          , 
        </mo> 
        <msubsup> 
         <mi>
           T 
         </mi> 
         <mi>
           i 
         </mi> 
         <mn>
           1 
         </mn> 
        </msubsup> 
        <mo>
          = 
        </mo> 
        <mn>
          0 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and is obtained as</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            or 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          β 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            β 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <msup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </msup> 
        <mo>
          + 
        </mo> 
        <mi>
          η 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <mi>
            η 
          </mi> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mn>
                1 
              </mn> 
              <mo>
                − 
              </mo> 
              <mi>
                p 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mi>
             k 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          . 
        </mo> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math></p>
   <p>Finally, the probability of declaring a pool positive on retesting the initially announced positive pool can be derived as</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mtable> 
      <mtr> 
       <mtd> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           3 
         </mn> 
        </msub> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mtext>
              
          </mtext> 
          <mtext>
            or 
          </mtext> 
          <mtext>
              
          </mtext> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            0 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mtext>
            
        </mtext> 
        <mo>
          + 
        </mo> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            , 
          </mo> 
          <msubsup> 
           <mi>
             T 
           </mi> 
           <mi>
             i 
           </mi> 
           <mn>
             1 
           </mn> 
          </msubsup> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
          <mo>
            / 
          </mo> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mi>
          P 
        </mi> 
        <mi>
          r 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             D 
           </mi> 
           <mi>
             i 
           </mi> 
          </msub> 
          <mo>
            = 
          </mo> 
          <mn>
            1 
          </mn> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mtd> 
      </mtr> 
      <mtr> 
       <mtd> 
        <mo>
          = 
        </mo> 
        <msup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             β 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mn>
           2 
         </mn> 
        </msup> 
        <msup> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mi>
           k 
         </mi> 
        </msup> 
        <mo>
          + 
        </mo> 
        <msup> 
         <mi>
           η 
         </mi> 
         <mn>
           2 
         </mn> 
        </msup> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msup> 
           <mrow> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mn>
                1 
              </mn> 
              <mo>
                − 
              </mo> 
              <mi>
                p 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mi>
             k 
           </mi> 
          </msup> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          . 
        </mo> 
       </mtd> 
      </mtr> 
     </mtable> 
    </math></p>
   <p>The above three probabilities 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         3 
       </mn> 
      </msub> 
     </mrow> 
    </math> are used to formulate the model of group testing with retesting as the joint probability distribution of the random variables 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mrow> 
        <mn>
          12 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> with joint probability mass function</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          ; 
        </mo> 
        <mi>
          p 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mfrac> 
       <mrow> 
        <mi>
          n 
        </mi> 
        <mo>
          ! 
        </mo> 
       </mrow> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          ! 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
        <mo>
          ! 
        </mo> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mi>
            n 
          </mi> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             x 
           </mi> 
           <mrow> 
            <mn>
              11 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          ! 
        </mo> 
       </mrow> 
      </mfrac> 
      <msubsup> 
       <mi>
         λ 
       </mi> 
       <mn>
         1 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </msubsup> 
      <msubsup> 
       <mi>
         λ 
       </mi> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
      </msubsup> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             λ 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             λ 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          n 
        </mi> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>, (1)</p>
   <p>which is a trinomial probability model with parameters 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         1 
       </mn> 
      </msub> 
      <mo>
        , 
      </mo> 
      <msub> 
       <mi>
         λ 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math>.</p>
   <p>The likelihood function of the parameter 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> is proportional to the trinomial probability mass function in (1). Taking 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        C 
      </mi> 
      <mo>
        = 
      </mo> 
      <mrow> 
       <mn>
         1 
       </mn> 
       <mo>
         / 
       </mo> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mfrac> 
           <mrow> 
            <mi>
              n 
            </mi> 
            <mo>
              ! 
            </mo> 
           </mrow> 
           <mrow> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
            <mo>
              ! 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mn>
                11 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              ! 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mn>
                12 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              ! 
            </mo> 
           </mrow> 
          </mfrac> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
      </mrow> 
     </mrow> 
    </math> as the constant of proportionality, the likelihood function is given as</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        L 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         p 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ∝ 
      </mo> 
      <msubsup> 
       <mi>
         λ 
       </mi> 
       <mn>
         1 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
      </msubsup> 
      <msubsup> 
       <mi>
         λ 
       </mi> 
       <mn>
         2 
       </mn> 
       <mrow> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
      </msubsup> 
      <msup> 
       <mrow> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <mn>
            1 
          </mn> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             λ 
           </mi> 
           <mn>
             1 
           </mn> 
          </msub> 
          <mo>
            − 
          </mo> 
          <msub> 
           <mi>
             λ 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mrow> 
        <mi>
          n 
        </mi> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
      </msup> 
     </mrow> 
    </math>. (2)</p>
   <p>The log-likelihood function is</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        l 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mi>
         p 
       </mi> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        ∝ 
      </mo> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
      <mi>
        log 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <msub> 
       <mi>
         x 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
      <mi>
        log 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        + 
      </mo> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          n 
        </mi> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           x 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mi>
        log 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          1 
        </mn> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           1 
         </mn> 
        </msub> 
        <mo>
          − 
        </mo> 
        <msub> 
         <mi>
           λ 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> (3)</p>
  </sec><sec id="s4">
   <title>4. Interval Estimation Methods</title>
   <p>Interval estimation is a statistical technique used to estimate the range within which a population parameter is expected to lie with a certain level of confidence. It provides information regarding the closeness of a point estimate to the true parameter value by giving a range of plausible values for the parameter.</p>
   <sec id="s4_1">
    <title>4.1. Wald Confidence Interval</title>
    <p>The Wald confidence interval is the most widely used approximate confidence interval and is based on the asymptotic normality property of the maximum likelihood estimator of the parameter of interest. Let 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mover accent="true"> 
       <mi>
         p 
       </mi> 
       <mo>
         ^ 
       </mo> 
      </mover> 
     </math> be the MLE of the prevalence rate 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> obtained by maximizing the log-likelihood function in equation (3). Then by the asymptotic property of the MLE the sampling distribution of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mfrac> 
        <mrow> 
         <mover accent="true"> 
          <mi>
            p 
          </mi> 
          <mo>
            ^ 
          </mo> 
         </mover> 
         <mo>
           − 
         </mo> 
         <mi>
           p 
         </mi> 
        </mrow> 
        <mrow> 
         <mi>
           S 
         </mi> 
         <mi>
           E 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mover accent="true"> 
           <mi>
             p 
           </mi> 
           <mo>
             ^ 
           </mo> 
          </mover> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math> is approximately standard normal. The standard error is defined as 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         S 
       </mi> 
       <mi>
         E 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mover accent="true"> 
         <mi>
           p 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mn>
          1 
        </mn> 
        <mrow> 
         <msqrt> 
          <mrow> 
           <mi>
             I 
           </mi> 
           <mrow> 
            <mo>
              ( 
            </mo> 
            <mover accent="true"> 
             <mi>
               p 
             </mi> 
             <mo>
               ^ 
             </mo> 
            </mover> 
            <mo>
              ) 
            </mo> 
           </mrow> 
          </mrow> 
         </msqrt> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math>, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         I 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mover accent="true"> 
         <mi>
           p 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> is the observed Fisher information. Given 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         α 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, the 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         100 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mi>
           α 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         % 
       </mi> 
      </mrow> 
     </math> Wald confidence interval of the prevalence rate 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> is given by 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mover accent="true"> 
        <mi>
          p 
        </mi> 
        <mo>
          ^ 
        </mo> 
       </mover> 
       <mo>
         ± 
       </mo> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mrow> 
         <mfrac> 
          <mi>
            α 
          </mi> 
          <mn>
            2 
          </mn> 
         </mfrac> 
        </mrow> 
       </msub> 
       <mi>
         S 
       </mi> 
       <mi>
         E 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mover accent="true"> 
         <mi>
           p 
         </mi> 
         <mo>
           ^ 
         </mo> 
        </mover> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          Z 
        </mi> 
        <mrow> 
         <mfrac> 
          <mi>
            α 
          </mi> 
          <mn>
            2 
          </mn> 
         </mfrac> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> is the upper 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         100 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mfrac> 
          <mi>
            α 
          </mi> 
          <mn>
            2 
          </mn> 
         </mfrac> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         t 
       </mi> 
       <mi>
         h 
       </mi> 
      </mrow> 
     </math> percentile of the standard normal distribution. The most commonly used values of α are 0.1, 0.05, and 0.01, which correspond to confidence levels of 90%, 95%, and 99%, respectively.</p>
   </sec>
   <sec id="s4_2">
    <title>4.2. Bayesian Credible Intervals</title>
    <p>In the Bayesian credible interval approach, the prevalence rate parameter 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> is a random variable with on probability density function on the parameter space, 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mtext>
         Θ 
       </mtext> 
       <mo>
         = 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The joint probability mass function in equation (1) will be considered as a conditional mass function of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mrow> 
         <mn>
           11 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mrow> 
         <mn>
           12 
         </mn> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> given 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         p 
       </mi> 
       <mo> 
       </mo> 
      </mrow> 
     </math>and written as 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         f 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             11 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             12 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           / 
         </mo> 
         <mi>
           p 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>. The unknown parameter is assigned a probability distribution, denoted by 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          p 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, called the prior distribution of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math>, This reflects an experimenter’s subjective belief regarding which p-values are more or less likely when one considers the whole parameter space. The evidences about 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> from the prior distribution 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          p 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> and the likelihood function 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         L 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mi>
          p 
        </mi> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> are combined by means of the Bayes Theorem to come up with what is known as a posterior distribution. In this study, we use the Beta distribution as a prior for the parameter of interest because the distribution is flexible and appropriate for modeling proportions. The Beta distribution has many shapes and is popularly used in Bayesian statistics for modeling an unknown proportion The values of parameters of the Beta distribution can be chosen so that it reflects a prior information about a small proportion. Since the prevalence rate is close to zero using a non-informative uniform distribution over the interval (0,1) may lead to inaccurate interval estimates.</p>
    <p>Let 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         g 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             11 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             12 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <mi>
           p 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> be the joint probability distribution of the 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mrow> 
         <mn>
           11 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          X 
        </mi> 
        <mrow> 
         <mn>
           12 
         </mn> 
        </mrow> 
       </msub> 
      </mrow> 
     </math> and 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math>. The posterior distribution of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> given 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mn>
          2 
        </mn> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mn>
           11 
         </mn> 
        </mrow> 
       </msub> 
       <mo>
         , 
       </mo> 
       <msub> 
        <mi>
          x 
        </mi> 
        <mrow> 
         <mn>
           12 
         </mn> 
        </mrow> 
       </msub> 
      </mrow> 
     </math>, denoted by 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mo>
           / 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            2 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             11 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             12 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, is defined as</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         π 
       </mi> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mi>
           p 
         </mi> 
         <mo>
           / 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mn>
            1 
          </mn> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             11 
           </mn> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            x 
          </mi> 
          <mrow> 
           <mn>
             12 
           </mn> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mo>
         = 
       </mo> 
       <mfrac> 
        <mrow> 
         <mi>
           g 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mn>
              2 
            </mn> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mn>
               11 
             </mn> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mn>
               12 
             </mn> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <mi>
             p 
           </mi> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
        </mrow> 
        <mrow> 
         <mstyle displaystyle="true"> 
          <mrow> 
           <msubsup> 
            <mo>
              ∫ 
            </mo> 
            <mn>
              0 
            </mn> 
            <mn>
              1 
            </mn> 
           </msubsup> 
           <mrow> 
            <mi>
              g 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mn>
                 2 
               </mn> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mn>
                  11 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <msub> 
               <mi>
                 x 
               </mi> 
               <mrow> 
                <mn>
                  12 
                </mn> 
               </mrow> 
              </msub> 
              <mo>
                , 
              </mo> 
              <mi>
                p 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mtext>
              d 
            </mtext> 
            <mi>
              p 
            </mi> 
           </mrow> 
          </mrow> 
         </mstyle> 
        </mrow> 
       </mfrac> 
      </mrow> 
     </math>. (4)</p>
    <p>The credible interval of the prevalence rate 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> is constructed using the above posterior distribution and is defined as follows: for fixed 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         α 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, a subset 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mi>
          Θ 
        </mi> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> of the parameter space 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        Θ 
      </mi> 
     </math> is called 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         100 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mi>
           α 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         % 
       </mi> 
      </mrow> 
     </math> credible interval for 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> if and only if the posterior probability of the subset 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mtext>
          Θ 
        </mtext> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> is at least 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <mi>
         α 
       </mi> 
      </mrow> 
     </math></p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mstyle displaystyle="true"> 
        <mrow> 
         <msub> 
          <mo>
            ∫ 
          </mo> 
          <mrow> 
           <msup> 
            <mi>
              Θ 
            </mi> 
            <mo>
              * 
            </mo> 
           </msup> 
          </mrow> 
         </msub> 
         <mrow> 
          <mi>
            π 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              p 
            </mi> 
            <mo>
              / 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mn>
               2 
             </mn> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mn>
                11 
              </mn> 
             </mrow> 
            </msub> 
            <mo>
              , 
            </mo> 
            <msub> 
             <mi>
               x 
             </mi> 
             <mrow> 
              <mn>
                12 
              </mn> 
             </mrow> 
            </msub> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mtext>
            d 
          </mtext> 
          <mi>
            p 
          </mi> 
         </mrow> 
        </mrow> 
       </mstyle> 
       <mo>
         ≥ 
       </mo> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <mi>
         α 
       </mi> 
      </mrow> 
     </math>. (5)</p>
    <p>For a given value 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         α 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math> there is a long list of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mi>
           α 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mn>
         100 
       </mn> 
       <mi>
         % 
       </mi> 
      </mrow> 
     </math> competing credible intervals, and the optimal credible interval should be short and includes only those values of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> which are very likely according to the posterior distribution. Such a credible interval is called highest posterior density (HPD) and is defined as follows: for a fixed 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mi>
         α 
       </mi> 
       <mo>
         ∈ 
       </mo> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           0 
         </mn> 
         <mo>
           , 
         </mo> 
         <mn>
           1 
         </mn> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, a subset 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mtext>
          Θ 
        </mtext> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> of the parameter space 
     <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mtext>
        Θ 
      </mtext> 
     </math> is called 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         100 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mi>
           α 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         % 
       </mi> 
      </mrow> 
     </math> HPD credible interval for 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> if and only if the subset 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mtext>
          Θ 
        </mtext> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> has the following form:</p>
    <p>
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          { 
        </mo> 
        <mrow> 
         <mi>
           θ 
         </mi> 
         <mo>
           : 
         </mo> 
         <mi>
           π 
         </mi> 
         <mrow> 
          <mo>
            ( 
          </mo> 
          <mrow> 
           <mi>
             p 
           </mi> 
           <mo>
             / 
           </mo> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mn>
              1 
            </mn> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mn>
               11 
             </mn> 
            </mrow> 
           </msub> 
           <mo>
             , 
           </mo> 
           <msub> 
            <mi>
              x 
            </mi> 
            <mrow> 
             <mn>
               12 
             </mn> 
            </mrow> 
           </msub> 
          </mrow> 
          <mo>
            ) 
          </mo> 
         </mrow> 
         <mo>
           ≥ 
         </mo> 
         <mi>
           k 
         </mi> 
        </mrow> 
        <mo>
          } 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, (6)</p>
    <p>where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        k 
      </mi> 
     </math> depends on 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        α 
      </mi> 
     </math> and data, and is the largest constant such that the probability of 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mtext>
          Θ 
        </mtext> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> is at least 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         1 
       </mn> 
       <mo>
         − 
       </mo> 
       <mi>
         α 
       </mi> 
      </mrow> 
     </math>. If the posterior density is symmetric about its finite mean, then the 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mn>
         100 
       </mn> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <mn>
           1 
         </mn> 
         <mo>
           − 
         </mo> 
         <mi>
           α 
         </mi> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
       <mi>
         % 
       </mi> 
      </mrow> 
     </math> HPD credible interval 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msup> 
        <mtext>
          Θ 
        </mtext> 
        <mo>
          * 
        </mo> 
       </msup> 
      </mrow> 
     </math> will be the shortest, equal-tailed and symmetric about the posterior mean.</p>
    <p>We note that it is not possible to derive the analytical form of the posterior density in (4) and therefore we apply the gridding approximation algorithm to simulate it. Suppose that G values of the prevalence rate 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        p 
      </mi> 
     </math> are simulated from the posterior density. Then an equal-tailed credible interval is computed as 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <mrow> 
        <mo>
          ( 
        </mo> 
        <mrow> 
         <msub> 
          <mi>
            q 
          </mi> 
          <mrow> 
           <mfrac> 
            <mi>
              α 
            </mi> 
            <mn>
              2 
            </mn> 
           </mfrac> 
          </mrow> 
         </msub> 
         <mo>
           , 
         </mo> 
         <msub> 
          <mi>
            q 
          </mi> 
          <mrow> 
           <mn>
             1 
           </mn> 
           <mo>
             − 
           </mo> 
           <mfrac> 
            <mi>
              α 
            </mi> 
            <mn>
              2 
            </mn> 
           </mfrac> 
          </mrow> 
         </msub> 
        </mrow> 
        <mo>
          ) 
        </mo> 
       </mrow> 
      </mrow> 
     </math>, where 
     <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
       <msub> 
        <mi>
          q 
        </mi> 
        <mi>
          z 
        </mi> 
       </msub> 
      </mrow> 
     </math> is the z-quantile of the posterior distribution.</p>
   </sec>
  </sec><sec id="s5">
   <title>5. Simulation Study</title>
   <p>In this section, simulation studies are conducted to evaluate the performance of the Bayesian interval estimation method relative to the traditional Wald method. Various simulation scenarios with different prevalence rates 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math>, pool sizes 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math>, and pool numbers 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       n 
     </mi> 
    </math> are considered. For each scenario, the performances of Bayesian credible interval and Wald confidence interval for the prevalence rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> were compared on the basis of coverage probability and expected length. Let 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       r 
     </mi> 
    </math> denote the observed values of the random variables 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mn>
         2 
       </mn> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <msub> 
       <mi>
         X 
       </mi> 
       <mrow> 
        <mn>
          11 
        </mn> 
       </mrow> 
      </msub> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        f 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          k 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          r 
        </mi> 
        <mo>
          ; 
        </mo> 
        <mi>
          p 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denote the value of the trinomial probability mass function in (1). It follows that for any confidence interval method for estimating the prevalence rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> the actual coverage probability at a fixed value of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> is given by</p>
   <p>
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        C 
      </mi> 
      <mi>
        p 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          p 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          r 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mi>
            r 
          </mi> 
         </msub> 
         <mrow> 
          <mi>
            I 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              r 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              n 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              r 
            </mi> 
            <mo>
              ; 
            </mo> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math>, (7)</p>
   <p>where the indicator function 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        I 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          k 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          r 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> takes the value 1 if the interval covers the value of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> and the value 0 if the interval does not cover the value of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math>. Let 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        L 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        U 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> denote the lower and upper confidence limits, respectively. The expected length of the random interval 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         [ 
       </mo> 
       <mrow> 
        <mi>
          L 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             X 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             X 
           </mi> 
           <mrow> 
            <mn>
              11 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
        <mo>
          , 
        </mo> 
        <mi>
          U 
        </mi> 
        <mrow> 
         <mo>
           ( 
         </mo> 
         <mrow> 
          <msub> 
           <mi>
             X 
           </mi> 
           <mn>
             2 
           </mn> 
          </msub> 
          <mo>
            , 
          </mo> 
          <msub> 
           <mi>
             X 
           </mi> 
           <mrow> 
            <mn>
              11 
            </mn> 
           </mrow> 
          </msub> 
         </mrow> 
         <mo>
           ) 
         </mo> 
        </mrow> 
       </mrow> 
       <mo>
         ] 
       </mo> 
      </mrow> 
     </mrow> 
    </math> is given by</p>
   <p>
    <math display="inline" xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        E 
      </mi> 
      <mi>
        L 
      </mi> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mi>
          p 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          k 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          r 
        </mi> 
        <mo>
          , 
        </mo> 
        <mi>
          n 
        </mi> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
      <mo>
        = 
      </mo> 
      <mstyle displaystyle="true"> 
       <msub> 
        <mo>
          ∑ 
        </mo> 
        <mi>
          k 
        </mi> 
       </msub> 
       <mrow> 
        <mstyle displaystyle="true"> 
         <msub> 
          <mo>
            ∑ 
          </mo> 
          <mi>
            r 
          </mi> 
         </msub> 
         <mrow> 
          <mrow> 
           <mo>
             [ 
           </mo> 
           <mrow> 
            <mi>
              U 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                k 
              </mi> 
              <mo>
                , 
              </mo> 
              <mi>
                r 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
            <mo>
              − 
            </mo> 
            <mi>
              L 
            </mi> 
            <mrow> 
             <mo>
               ( 
             </mo> 
             <mrow> 
              <mi>
                k 
              </mi> 
              <mo>
                , 
              </mo> 
              <mi>
                r 
              </mi> 
             </mrow> 
             <mo>
               ) 
             </mo> 
            </mrow> 
           </mrow> 
           <mo>
             ] 
           </mo> 
          </mrow> 
          <mi>
            f 
          </mi> 
          <mrow> 
           <mo>
             ( 
           </mo> 
           <mrow> 
            <mi>
              k 
            </mi> 
            <mo>
              , 
            </mo> 
            <mi>
              r 
            </mi> 
            <mo>
              ; 
            </mo> 
            <mi>
              p 
            </mi> 
           </mrow> 
           <mo>
             ) 
           </mo> 
          </mrow> 
         </mrow> 
        </mstyle> 
       </mrow> 
      </mstyle> 
     </mrow> 
    </math>, (8)</p>
   <p>For the simulation study we arbitrarily set the number of pools at 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        n 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        100 
      </mn> 
     </mrow> 
    </math>. The 95% Bayesian credible intervals and 95% Wald confidence intervals were constructed for 1000 simulations of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mn>
           2 
         </mn> 
        </msub> 
        <mo>
          , 
        </mo> 
        <msub> 
         <mi>
           X 
         </mi> 
         <mrow> 
          <mn>
            11 
          </mn> 
         </mrow> 
        </msub> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> for a fixed values of the prevalence rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> and pool size 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math>. The coverage probability and expected length are then computed for each of the two interval estimation methods. The values of the prevalence rates and pool sizes used in the simulation study are 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        p 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0.003 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        0.01 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        0.05 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        0.1 
      </mn> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        k 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        5 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        15 
      </mn> 
      <mo>
        , 
      </mo> 
      <mn>
        20 
      </mn> 
     </mrow> 
    </math>. <xref ref-type="table" rid="table1">
     Table 1
    </xref> and <xref ref-type="table" rid="table2">
     Table 2
    </xref> respectively show the computed coverage probabilities and mean interval length (in parenthesis) for the Bayesian credible intervals and Wald confidence intervals for various values of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math>. The Bayesian credible interval has coverage probabilities which are higher than the nominal level and the mean interval lengths are extremely short. The coverage probabilities draw closer to the nominal level as pool size increases. On the other hand, the coverage probabilities for the Wald confidence interval are lower but on average closer to the nominal level and the mean interval lengths are very large as compared to those of credible intervals.</p>
   <p>To investigate the effects of group size 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math> and the prevalence rate 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> on the performance of the two methods of interval estimation, coverage probabilities and mean lengths of the credible and Wald confidence intervals were computed repeatedly for different pairs of values of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math>. The following three pairs of values of 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       k 
     </mi> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
       p 
     </mi> 
    </math> were arbitrarily chosen and used in the simulation study: 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          10 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          0.1 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>, 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          20 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          0.1 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mrow> 
       <mo>
         ( 
       </mo> 
       <mrow> 
        <mn>
          10 
        </mn> 
        <mo>
          , 
        </mo> 
        <mn>
          0.01 
        </mn> 
       </mrow> 
       <mo>
         ) 
       </mo> 
      </mrow> 
     </mrow> 
    </math>. <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref> and <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref> show plots of coverage probabilities and mean interval lengths of the 95% Bayesian credible intervals and 95% Wald confidence intervals, respectively, when 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        k 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        10 
      </mn> 
     </mrow> 
    </math> and 
    <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
      <mi>
        p 
      </mi> 
      <mo>
        = 
      </mo> 
      <mn>
        0.1 
      </mn> 
     </mrow> 
    </math>. The coverage probabilities (in <xref ref-type="fig" rid="fig2">
     Figure 2
    </xref>) for both types of interval estimates for the prevalence rate show short upward and downward spikes and are close to the nominal level, however, most coverage probabilities for the Wald confidence intervals are below the normimal level as compared to those of the Bayesian credible intervals which are evenly distributed about the nominal level. The graphs in <xref ref-type="fig" rid="fig3">
     Figure 3
    </xref> demonstrate that on average the mean interval length for the Bayes credible intervals are smaller than that of the wald comfidence interval.</p>
   <table-wrap id="table1">
    <label>
     <xref ref-type="table" rid="table1">
      Table 1
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.143708-"></xref>Table 1. Coverage probabilities and mean interval lengths (in parenthesis) of the nominal 95% Bayesian interval credible intervals for the prevalence rate 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        
  p
 
       </mi>

      </math>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td custom-top-td cell-with-diagonal-border aright" width="20.94%"><p style="text-align:right"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
           k 
         </mi> 
        </math></p><p style="text-align:left"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
           p 
         </mi> 
        </math></p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.12%"><p style="text-align:center">5</p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.12%"><p style="text-align:center">15</p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.82%"><p style="text-align:center">20</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="20.94%"><p style="text-align:center">0.05</p></td> 
      <td class="custom-top-td acenter" width="26.12%"><p style="text-align:center">0.973 [0.0000156]</p></td> 
      <td class="custom-top-td acenter" width="26.12%"><p style="text-align:center">0.957 [0.0000088]</p></td> 
      <td class="custom-top-td acenter" width="26.82%"><p style="text-align:center">0.956 [0.000005806]</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="20.94%"><p style="text-align:center">0.01</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.986 [0.00001702]</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.963 [0.0000102]</p></td> 
      <td class="acenter" width="26.82%"><p style="text-align:center">0.952 [0.00000941]</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="20.94%"><p style="text-align:center">0.05</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.983 [0.00003764]</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.965 [0.0000258]</p></td> 
      <td class="acenter" width="26.82%"><p style="text-align:center">0.959 [0.0000240]</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td acenter" width="20.94%"><p style="text-align:center">0.1</p></td> 
      <td class="custom-bottom-td acenter" width="26.12%"><p style="text-align:center">0.988 [0.00004985]</p></td> 
      <td class="custom-bottom-td acenter" width="26.12%"><p style="text-align:center">0.972 [0.00003864]</p></td> 
      <td class="custom-bottom-td acenter" width="26.82%"><p style="text-align:center">0.980 [0.00004966]</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <table-wrap id="table2">
    <label>
     <xref ref-type="table" rid="table2">
      Table 2
     </xref></label>
    <caption>
     <title>
      <xref ref-type="bibr" rid="scirp.143708-"></xref>Table 2. Coverage probabilities and mean interval lengths (in parenthesis) of the nominal 95% Wald confidence intervals for the prevalence rate 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
        
  p
 
       </mi>

      </math>.</title>
    </caption>
    <table class="MsoTableGrid custom-table" border="0" cellspacing="0" cellpadding="0"> 
     <tr> 
      <td class="custom-bottom-td custom-top-td cell-with-diagonal-border aright" width="20.94%"><p style="text-align:right"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
           k 
         </mi> 
        </math></p><p style="text-align:left"> 
        <math xmlns="http://www.w3.org/1998/Math/MathML"> <mi>
           p 
         </mi> 
        </math></p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.12%"><p style="text-align:center">5</p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.12%"><p style="text-align:center">15</p></td> 
      <td class="custom-bottom-td custom-top-td acenter" width="26.82%"><p style="text-align:center">20</p></td> 
     </tr> 
     <tr> 
      <td class="custom-top-td acenter" width="20.94%"><p style="text-align:center">0.05</p></td> 
      <td class="custom-top-td acenter" width="26.12%"><p style="text-align:center">0.998 [0.030517]</p></td> 
      <td class="custom-top-td acenter" width="26.12%"><p style="text-align:center">0.909 [0.008167]</p></td> 
      <td class="custom-top-td acenter" width="26.82%"><p style="text-align:center">0.950 [0.00673]</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="20.94%"><p style="text-align:center">0.01</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.931 [0.020388]</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.938 [0.010986]</p></td> 
      <td class="acenter" width="26.82%"><p style="text-align:center">0.941 [0.009811]</p></td> 
     </tr> 
     <tr> 
      <td class="acenter" width="20.94%"><p style="text-align:center">0.05</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.942 [0.04274]</p></td> 
      <td class="acenter" width="26.12%"><p style="text-align:center">0.953 [0.02934]</p></td> 
      <td class="acenter" width="26.82%"><p style="text-align:center">0.938 [0.02775]</p></td> 
     </tr> 
     <tr> 
      <td class="custom-bottom-td acenter" width="20.94%"><p style="text-align:center">0.1</p></td> 
      <td class="custom-bottom-td acenter" width="26.12%"><p style="text-align:center">0.945 [0.06341]</p></td> 
      <td class="custom-bottom-td acenter" width="26.12%"><p style="text-align:center">0.949 [0.05522]</p></td> 
      <td class="custom-bottom-td acenter" width="26.82%"><p style="text-align:center">0.961 [0.06386]</p></td> 
     </tr> 
    </table>
   </table-wrap>
   <fig id="fig2" position="float">
    <label>Figure 2</label>
    <caption>
     <title>Figure 2. Plots of coverage probabilities of the 93% credible intervals and 95% Wald confidence intervals when 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   k
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   10
  
        </mn>
 
       </mrow>

      </math> and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   p
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   0.1
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId308.jpeg?20250630035037" />
   </fig>
   <fig id="fig3" position="float">
    <label>Figure 3</label>
    <caption>
     <title>Figure 3. Plots of mean interval lengths of the 95% credible intervals and 95% Wald confidence intervals when 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   k
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   10
  
        </mn>
 
       </mrow>

      </math> and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   p
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   0.1
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId313.jpeg?20250630035036" />
   </fig>
   <p>
    <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref> and <xref ref-type="fig" rid="fig5">
     Figure 5
    </xref> show the graphs of coverage probabilities and mean interval lengths for the 95% credible intervals and 95% Wald confidence intervals when the group size is increased to 20 and the prevalence rate is kept constant at 0.1. <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref> shows that the coverage probability of the Wald confidence interval is increased above the nominal level when the group size is increased to 20. On the other hand, the coverage probabilities of Bayesian credible interval are close to the nominal level and are not affected by the upward change in group size. In <xref ref-type="fig" rid="fig4">
     Figure 4
    </xref>, the mean interval lengths of the 95% Wald confidence intervals have long upward and downward spikes as compared to those of the credible intervals, which are short and uniform. This implies that Wald method produces wider confidence intervals when group size is increased and hence is less accurate. Increasing group size reduces the number of groups (less data) and hence the Wald method performs poorly since it is based on large sample theory.</p>
   <fig id="fig4" position="float">
    <label>Figure 4</label>
    <caption>
     <title>Figure 4. Plots of coverage probabilities of the 95% credible intervals and 95% Wald confidence intervals when 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   k
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   20
  
        </mn>
 
       </mrow>

      </math> and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   p
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   0.1
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId316.jpeg?20250630035036" />
   </fig>
   <fig id="fig5" position="float">
    <label>Figure 5</label>
    <caption>
     <title>Figure 5. Plots of mean interval lengths of the 95% credible intervals and 95% Wald confidence intervals when 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   k
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   20
  
        </mn>
 
       </mrow>

      </math> and 

      <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
        <mi>
         
   p
  
        </mi>
  
        <mo>
         
   =
  
        </mo>
  
        <mn>
         
   0.1
  
        </mn>
 
       </mrow>

      </math>.</title>
    </caption>
    <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId320.jpeg?20250630035037" />
   </fig>
   <p>Lastly, <xref ref-type="fig" rid="fig6">
     Figure 6
    </xref> and <xref ref-type="fig" rid="fig7">
     Figure 7
    </xref> present the plots of coverage probabilities and mean interval lengths for the 95% credible intervals and 95% Wald confidence intervals when the group size is kept constant at 20 and prevalence rate is decreased to 0.01. In <xref ref-type="fig" rid="fig6">
     Figure 6
    </xref> it can be observed that the coverage probabilities of the interval estimates produced by both interval estimation methods are on average less than the nominal level; the upward and downward spikes show the same pattern. However, the plots of mean interval lengths in <xref ref-type="fig" rid="fig7">
     Figure 7
    </xref> indicate that the performance of the Wald method decreases further with decrease in the prevalence rate while that of the Bayesian method is good.</p>
   <sec id="s5_1">
    <title>5.1. Results Interpretation</title>
    <p>The simulation results demonstrate that Bayesian credible intervals generally outperform Wald confidence intervals, particularly in scenarios with low prevalence rates and smaller pool sizes. This superior performance is attributed to the Bayesian</p>
    <fig id="fig6" position="float">
     <label>Figure 6</label>
     <caption>
      <title>Figure 6. Plots of coverage probabilities of the 95% credible intervals and 95% Wald confidence intervals when 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   k
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   20
  
         </mn>
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   p
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   0.01
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId325.jpeg?20250630035037" />
    </fig>
    <fig id="fig7" position="float">
     <label>Figure 7</label>
     <caption>
      <title>Figure 7. Plots of mean interval lengths of the 95% credible intervals and 95% Wald confidence intervals when 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   k
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   20
  
         </mn>
 
        </mrow>

       </math> and 

       <math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow> 
  
         <mi>
          
   p
  
         </mi>
  
         <mo>
          
   =
  
         </mo>
  
         <mn>
          
   0.01
  
         </mn>
 
        </mrow>

       </math>.</title>
     </caption>
     <graphic mimetype="image" position="float" xlink:type="simple" xlink:href="https://html.scirp.org/file/1241946-rId330.jpeg?20250630035037" />
    </fig>
    <p>method’s ability to incorporate prior information and its robustness to variability, making it less sensitive to small sample sizes and low prevalence rates. In contrast, the Wald method relies on normal approximation, which becomes unreliable when the prevalence rate is close to zero or the sample size is limited. Consequently, the Wald intervals tend to be wider and less accurate under such conditions, whereas Bayesian intervals maintain consistent coverage probabilities close to the nominal level and have narrower interval widths.</p>
    <p>However, in cases where the prevalence rate and sample size are relatively large, both methods tend to perform similarly, as the Wald method’s reliance on asymptotic normality becomes more reliable. Despite this, the Bayesian approach still provides a slight advantage by yielding more stable and efficient interval estimates.</p>
   </sec>
   <sec id="s5_2">
    <title>5.2. Practical Implications</title>
    <p>The findings have significant implications for public health decision-making. Accurate prevalence estimation is crucial in managing infectious disease outbreaks and allocating healthcare resources efficiently. The use of Bayesian credible intervals allows for more precise estimation, especially in low-prevalence settings, enabling policymakers to make data-driven decisions with greater confidence. Furthermore, the ability to incorporate prior information can enhance predictive accuracy when prior data or expert knowledge is available. In contrast, reliance on the Wald method in such scenarios might lead to overestimating uncertainty, resulting in either excessive caution or insufficient intervention measures. Adopting Bayesian methods can therefore optimize decision-making processes, particularly in surveillance and screening programs.</p>
   </sec>
  </sec><sec id="s6">
   <title>6. Conclusions</title>
   <p>The results of the above simulation study indicate that the Bayesian interval estimation method produced more accurate interval estimates with coverage probabilities close to the nominal level of 0.95 and short interval widths than the traditional Wald method, for all the cases considered. The Wald confidence intervals had coverage probabilities close to the nominal level for all the cases considered. However, their mean interval widths were large and hence were inaccurate. In <xref ref-type="fig" rid="fig7">
     Figure 7
    </xref>, the graph of mean interval width for the Wald confidence interval has long spikes implying that as the pool size increases the Wald confidence interval becomes wider and hence inaccurate. On the other hand, the graph of Bayesian interval widths on the same figure has short spikes, indicating the precision of the credible intervals is not significantly affected by increased pool size and hence it is more efficient in estimating prevalence rate. Finally, it can be observed that the accuracy of the interval estimates constructed by both methods is good at lower prevalence rates and pool sizes and deteriorates (although slightly for the Bayesian method) with an increase in the prevalence rate and pool size. This may be due to the fact that the efficiency of pool testing is low at a higher prevalence rate. Also, the accuracy of the Wald method depends on normal approximation to the binomial, which may be poor for all the prevalence rates used in the simulation study. In this paper we assume that both the specificity and sensitivity of the testing kit are equal and fixed at 0.95. However, they can be varied in a future study to investigate their effects on the efficiency of the two interval estimation methods for the prevalence rate of a rare trait.</p>
   <p>This study demonstrates that the Bayesian interval estimation method provides more accurate and efficient interval estimates for prevalence rates compared to the traditional Wald method. The Bayesian approach consistently achieves coverage probabilities closer to the nominal level, even when prevalence rates are low or sample sizes are small. In contrast, the Wald method often produces wider intervals and lower coverage probabilities under similar conditions due to its reliance on normal approximation. The practical implications of these findings are significant for public health decision-making. Accurate prevalence estimation enables better resource allocation, outbreak management, and screening program optimization. By incorporating prior information and maintaining robustness to variability, Bayesian methods enhance the reliability of prevalence estimates, particularly in low-prevalence scenarios. Future research should investigate the impact of varying specificity and sensitivity, and the number of pools on interval estimation efficiency. Adjusting these parameters could provide further insights into optimizing the Bayesian approach for different diagnostic contexts. Our next research project is to construct Likelihood confidence intervals for the prevalence rate in pool testing with retesting design and compare them with the Bayes credible intervals using simulation.</p>
  </sec>
 </body><back>
  <ref-list>
   <title>References</title>
   <ref id="scirp.143708-ref1">
    <label>1</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Dorfman, R. (1943) The Detection of Defective Members of Large Populations. The Annals of Mathematical Statistics, 14, 436-440. &gt;https://doi.org/10.1214/aoms/1177731363
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref2">
    <label>2</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Spiegelhalter, D.J. and Best, N.G. (2003) Bayesian Approaches to Multiple Sources of Evidence and Uncertainty in Complex Cost‐Effectiveness Modelling. Statistics in Medicine, 22, 3687-3709. &gt;https://doi.org/10.1002/sim.1586
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref3">
    <label>3</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Tamba, C.L., and Nandelenga, M.W. (2014) Computation of Moments in Group Testing with Retesting and with Errors in Inspection. International Journal of Contemporary Advanced Mathematics (IJCM), 3, 1-15. 
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref4">
    <label>4</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Nyongesa, L.K. (2017) Pool Testing Algorithm for Estimating Prevalence with Im-Perfect Test. International Journal of Statistics and Systems, 12, 823-830.
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref5">
    <label>5</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Liu, A. and Liu, C. (2012) Bayesian Group Testing for the Estimation of the Prevalence Rate. Journal of Statistical Planning and Inference, 142, 750-763.
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref6">
    <label>6</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Hepworth, G. (2005) Confidence Intervals for Proportions Estimated by Group Testing with Groups of Unequal Size. Journal of Agricultural, Biological, and Environmental Statistics, 10, 478-497. &gt;https://doi.org/10.1198/108571105x81698
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref7">
    <label>7</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Orawo, L.A. (2021) Confidence Intervals for the Binomial Proportion: A Comparison of Four Methods. Open Journal of Statistics, 11, 806-816. &gt;https://doi.org/10.4236/ojs.2021.115047
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref8">
    <label>8</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A. and Rubin, D.B. (2013) Bayesian Data Analysis. 3rd Edition, CRC Press.
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref9">
    <label>9</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Brett, T.S., Rohani, P., and Drake, J.M. (2018) Anticipating Epidemic Transitions with Imperfect Data. PLOS Computational Biology, 14, e1006204. 
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref10">
    <label>10</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     McDonald, J.L. and Hodgson, D.J. (2018) Prior Precision, Prior Accuracy, and the Estimation of Disease Prevalence Using Imperfect Diagnostic Tests. Frontiers in Veterinary Science, 5, Article 83. &gt;https://doi.org/10.3389/fvets.2018.00083
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref11">
    <label>11</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Helman, S.K., Thompson, R.A. and Fox, S.E. (2020) Bayesian Latent Class Analysis to Estimate Disease Prevalence and Diagnostic Test Accuracy in Wildlife Populations. Preventive Veterinary Medicine, 180, Article 105030.
    </mixed-citation>
   </ref>
   <ref id="scirp.143708-ref12">
    <label>12</label>
    <mixed-citation publication-type="other" xlink:type="simple">
     Biggerstaff, B.J. (2008) Confidence Intervals for the Difference of Two Proportions Estimated from Pooled Samples. Journal of Agricultural, Biological, and Environmental Statistics, 13, 478-496. &gt;https://doi.org/10.1198/108571108x379055
    </mixed-citation>
   </ref>
  </ref-list>
 </back>
</article>