<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Variance Reduction Technique for the Failure Probability Estimation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Alexandra Borodina</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Institute of Applied Mathematical Research, Karelian Research Center RAS</institution>
          ,
          <addr-line>Petrozavodsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Petrozavodsk State University</institution>
          ,
          <addr-line>Petrozavodsk</addr-line>
          ,
          <country country="RU">Russia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>and Oleg Lukashenko</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>We develop a variance reduction technique to estimate a small failure probability in an unreliable system with repairs. Since the probability of failure is considered to be small, it is natural to use the rare event simulation techniques in order to decrease the variance of the the estimator. For degradation process we proposed a combined method based on two approaches designed to rare events simulation: the standard conditional Monte Carlo method and the splitting technique.</p>
      </abstract>
      <kwd-group>
        <kwd>Conditional Monte Carlo</kwd>
        <kwd>variance reduction</kwd>
        <kwd>failure probability</kwd>
        <kwd>splitting method</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        In this work, we consider a variance reduction technique based on conditional
Monte-Carlo method, which is based on the expression of desired quantity as
conditional expectation given some auxiliary random variable. This method is
highly e ective when we need to estimate a small probability of a rare event [
        <xref ref-type="bibr" rid="ref7 ref8">8,7</xref>
        ]
and allows to considerable reduce variance of the estimate by the appropriate
selection of an auxiliary variable.
      </p>
      <p>
        In this work we apply a special case of this method based on an improved
algorithm for rare event simulation suggested [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] for variance reduction when we
deal with heavy-tailed distributions.
      </p>
      <p>In this work we describe conditional Monte-Carlo method and illustrate it
by an application to estimation a degradation process containing a few steps, in
which a maintenance repair is applied to prevent a failure.</p>
      <p>
        This problem has been addressed in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], where we applied a standard splitting
method to speed-up estimation of the failure probability. This model is highly
motivated, and calculation of the failure probability and related stationary
characteristics is critically important to evaluate quality of service and reliability
of the system. It is worth mentioning that analytic methods as a rule are
unavailable in the case of non-Markov processes and an e ective simulation only
remains an e ective tool for the required estimating.
      </p>
      <p>
        In this research, we present some simulation results to demonstrate an
efciency of the variance reduction approach from [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] applied to the setting
described above.
      </p>
      <p>
        Now we shortly describe the model of the degradation process from [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which
is a random process X := fX(t); t 0g with a nite state space
      </p>
      <p>E = f0; 1; : : : ; L; : : : ; M; : : : ; K; F g
describing the degradation stages of the system.</p>
      <p>
        As it is illustrated in Fig. 1 the process starts in state X(0) = 0 and crosses
K 1 intermediate degradation states. When the process reaches the state M
(it happens with probability 1), the following two scenarios are possible: i) the
process X visits state K, where repair is performed during random time UK ,
then the process returns to stage L; ii) an instantaneous failure occurs if during a
random time V (with given distribution) the process is still at some intermediate
stage j 2 fM; : : : ; K 1g.
As a result, the process X jumps to a complete failure state F . Then the
system again is ready for work after a repair random time UF , with a given
distribution. After repair, the process returns to initial state 0. We emphasize
that structure of the degradation process is very convenient to application of the
splitting method to speed-up estimation of the failure probability by simulation.
For more details on the accelerated estimation of rare events by splitting method
see [
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6">3,4,5,6</xref>
        ].
      </p>
      <p>
        Besides, in the work [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], we heavily exploit di erent regenerative structures
of the degradation process. In particular, we have used the regeneration instants
when the process hits the state M . Upon reaching state M , a failure may happen
during random period V ; otherwise, a preventive repair occurs during time
K 1
SM;K = X Ti;
i=M
where Ti is a random length of the i stage of degradation, with a given
distribution. (Note that in general distribution of Ti may depend on the stage number
i.)
      </p>
      <p>As a result, we obtain two types of regeneration cycles of the degradation
process X. Denote by YF the length of the regeneration cycle with a failure, and
let YNF be the length of cycle with no failure. Thus (unconditional) regeneration
cycle length Y is</p>
      <p>
        Y = YF IfV SM;Kg + YNF IfSM;K&lt;V g:
where IA denotes indicator function. The variable Y plays an important role in
the analysis of degradation process [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The main task is to nd the probability
of instantaneous failure on the cycle
pF = P(SM;K
      </p>
      <p>V ):
2</p>
      <p>Conditional Monte Carlo for the failure probability
estimation
In this section we restrict ourselves to the particular case of homogeneous
degradation process when random variables Ti; i = 1; :::; K 1, which are identically
distributed with the distribution function FT . In this framework one can apply
an alternative approach, known as Conditional Monte Carlo.</p>
      <p>
        In a nutshell, the target probability is expressed as a conditional expectation
with respect to some auxiliary random variable. This method always leads to
variance reduction [
        <xref ref-type="bibr" rid="ref7 ref8">8,7</xref>
        ]. Unfortunately, it is often impossible, or at least very
di cult, to nd a suitable conditioning quantity. Hopefully, in our setting it
turns out to be possible by the following approach suggested by [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. To apply
this approach, we write the target probability as
pF = (K
      </p>
      <p>M )E F T (max(V</p>
      <p>SM;K 1; RM;K 1)) ;
where F T = 1</p>
      <p>F and
Given the two sequences of samples</p>
      <p>RM;K = max(TM ; :::; TK 1);</p>
      <p>
        SM;K = TM + ::: + TK 1:
fT (i) = (T M(i); :::; T K(i) 1); i = 1; :::; N g;
(1)
(2)
(3)
(4)
(5)
fV (i); i = 1; :::; N g;
we are able to de ne the required estimator of pF as follows
It has been shown in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] that such an estimator has a bounded relative error
(under some limitations on initial distributions).
3
      </p>
      <p>
        Implementation of the splitting method for the
degradation process
We also treat the degradation process as a regenerative process and consider
a modi cation of the splitting method [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for speed-up estimation of failure
probability pF .
      </p>
      <p>As in the case of the conditional Monte Carlo method, the key problem for
splitting is the randomness of the threshold value V . Note that the standard
formulation of the problem for the accelerated splitting method implies the presence
of a xed threshold V , the excess of which is a rare event.</p>
      <p>But, due to the speci c structure of degradation process, the splitting
technique is best suited (among the accelerated methods) to simulate regeneration
cycles in a degrading system and allows to estimate several characteristics
simultaneously in one run of the program. More speci cally, for a complete study
of the degradation system behavior, we also need to evaluate the average length
of regeneration cycle with and without failure; the mean (unconditional)
cycle length; the asymptotic reliability function. The splitting method will handle
this, whereas the conditional Monte Carlo method allows us to obtain the only
estimate for the probability pF .</p>
      <p>Nevertheless, experiments have shown that it is necessary to focus attention
on the probability estimation problem, since it has the greatest relative error
RE[pbF ] =
pV ar[pbF ] :</p>
      <p>Since failure is possible only after going to stage M , then we will split the
process trajectory after stage M . The moment of splitting occurs at the time of
regeneration i which corresponds to the moment of transition to stage M (see
Fig.2).</p>
      <p>At each level we generate Ri copies of the random variables (r.v.) Ti, M i
K 1. So, each original path generates D = RM RK 1 (dependent) subpaths
called group of cycles. The dependence is generated by the same pre-history of
realizations of SMK before splitting point at each stage.</p>
      <p>Thus, we obtain D realizations of SMK for one group of cycles. The cycles
belonging to di erent groups are independent by construction. The total number
of groups is denoted by RM 1. The total number of the failures in the ith group
is</p>
      <p>Ai =
i D</p>
      <p>X
j=(i 1) D+1</p>
      <p>I(j); i = 1; : : : ; RM 1;
where indicator I(j) = 1 for the cycle with failure (I(j) = 0, otherwise), and the
groups are i.i.d.</p>
      <p>The following convergence follows from the regenerative properties of the
sequence fI(j); j 1g:</p>
      <p>Further, for the alternative construction of this estimator, we can apply the
same algorithm as in section 2 using the formula (6).
4</p>
    </sec>
    <sec id="sec-2">
      <title>Conclusions</title>
      <p>
        In this paper, we consider a variance reduction technique developed in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and
combine it with simulation technique based on the splitting of the trajectories,
to accelerate estimation a small failure probability in a degradation process. We
verify this approach by some simulation experiments for Weibull and Pareto Ti
with uniform and exponential V .
      </p>
      <p>ACKNOWLEDGEMENTS
The study was carried out under state order to the Karelian Research Centre of
the Russian Academy of Sciences (Institute of Applied Mathematical Research
KarRC RAS) and supported by the Russian Foundation for Basic Research,
projects 18-07-00187, 18-07-00147, 18-07-00156.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Asmussen</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kroese</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          :
          <article-title>Improved algorithms for rare event simulation with heavy tails</article-title>
          .
          <source>Advances in Applied Probability</source>
          <volume>38</volume>
          ,
          <issue>545</issue>
          {
          <fpage>558</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Borodina</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Efrosinin</surname>
            ,
            <given-names>D.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morozov</surname>
            ,
            <given-names>E.V.</given-names>
          </string-name>
          :
          <article-title>Application of splitting to failure estimation in controllable degradation system</article-title>
          .
          <source>In: Communications in Computer and Information Science</source>
          . vol.
          <volume>700</volume>
          , pp.
          <volume>217</volume>
          {
          <fpage>230</fpage>
          . Springer International Publishing (
          <year>2017</year>
          ). https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -66836-9, http://www.springer. com/gb/book/9783319668352
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Garvels</surname>
          </string-name>
          , M.:
          <source>PhD Thesis</source>
          .
          <article-title>The splitting method in rare event simulation</article-title>
          . The University of Twente, The
          <string-name>
            <surname>Netherlands</surname>
          </string-name>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Glasserman</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Heidelberger</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shahabuddin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zajic</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Splitting for rare event simulation: analysis of simple cases</article-title>
          .
          <source>In: Proceedings of the 1996 Winter Simulation Conference</source>
          . pp.
          <volume>302</volume>
          {
          <issue>308</issue>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Heegaard</surname>
          </string-name>
          , P.E.:
          <article-title>A survey of speedup simulation techniques</article-title>
          .
          <source>In: Workshop tutorial on Rare Event Simulation. Aachen, Germany</source>
          . (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Heidelberger</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Fast simulation of rare events in queueing and reliability models</article-title>
          .
          <source>ACM Trans. Model. Comput. Simul</source>
          .
          <volume>5</volume>
          (
          <issue>1</issue>
          ),
          <volume>43</volume>
          {85 (Jan
          <year>1995</year>
          ). https://doi.org/10.1145/203091.203094, http://doi.acm.
          <source>org/10</source>
          .1145/203091. 203094
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kroese</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taimre</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Botev</surname>
            ,
            <given-names>Z.I.</given-names>
          </string-name>
          :
          <article-title>Handbook of Monte Carlo Methods</article-title>
          . John Wiley &amp; Sons (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ross</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Simulation. Elsevier</surname>
          </string-name>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Rubinstein</surname>
          </string-name>
          , R.Y.,
          <string-name>
            <surname>Kroese</surname>
            ,
            <given-names>D.P.</given-names>
          </string-name>
          :
          <article-title>Simulation and the Monte Carlo method</article-title>
          . John Wiley &amp; Sons, Inc., New Jersey (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>