Results on the convergence with probability one of stochastic approximation algorithms of the form [theta]n+1 = [theta]n - [gamma]n+1 h([theta]n) + un+1 are given, where the [theta]'s belong to some Banach space and {un} is a stochastic process. Using this extension of results of Kushner and...

Recursive parameter estimation in diffusion processes is considered. First, stability and asymptotic properties of the global, off-line MLE (maximum likelihood estimator) are obtained under explicit conditions. The MLE evolution equation is then derived by employing a generalized Itô...

This paper reports simulation experiments, applying the cross entropy method suchas the importance sampling algorithm for efficient estimation of rare event probabilities in Markovian reliability systems. The method is compared to various failurebiasing schemes that have been proved to give...

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...

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

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 paper we describe a Sequential Importance Sampling (SIS) procedure for counting the number of vertex covers in general graphs. The performance of SIS depends heavily on how close the SIS proposal distribution is to a uniform one over a suitably restricted set. The proposed algorithm...

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...