We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of...

In this article we consider the efficient estimation of the tail distribution of the maximum of correlated normal random variables. We show that the currently recommended Monte Carlo estimator has difficulties in quantifying its precision, because its sample variance estimator is an inefficient...

In this article we consider the efficient estimation of the tail distribution of the maximum of correlated normal random variables. We show that the currently recommended Monte Carlo estimator has difficulties in quantifying its precision, because its sample variance estimator is an inefficient...

The Cross Entropy method is a well-known adaptive importance sampling method for rare-event probability estimation, which requires estimating an optimal importance sampling density within a parametric class. In this article we estimate an optimal importance sampling density within a wider...

A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...

There are various importance sampling schemes to estimate rare event probabilities in Markovian systems such as Markovian reliability models and Jackson networks. In this work, we present a general state dependent importance sampling method which partitions the state space and applies the...