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 rare event simulation, we look for estimators such that the relative accuracy of the output is 'controlled' when the rarity is getting more and more critical. Different robustness properties have been defined in the literature, that an estimator is expected to satisfy. Though, those...

A sequence of real numbers (xn) is Benford if the significands, i.e. the fraction parts in the floating-point representation of (xn), are distributed logarithmically. Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain with probability transition matrix P and limiting...