In some recent papers, some procedures based on some weighted empirical measures related to decreasing-step Euler schemes have been investigated to approximate the stationary regime of a diffusion (possibly with jumps) for a class of functionals of the process. This method is efficient but needs...

In the paper Bally and Pagès (2000) an algorithm based on an optimal discrete quantization tree is designed to compute the solution of multi-dimensional obstacle problems for homogeneous -valued Markov chains (Xk)0[less-than-or-equals, slant]k[less-than-or-equals, slant]n. This tree is made up...

This paper shows that the 2-neighbour Kohonen algorithm is self-organizing under pretty general assumptions on the stimuli distribution [mu] (supp([mu]c) contains a non-empty open set) and is a.s. convergent--in a weakened sense--as soon as [mu] admits a log-concave density. The 0-neighbour...

The functional quantization problem for one-dimensional Brownian diffusions on [0,T] is investigated. One shows under rather general assumptions that the rate of convergence of the Lp-quantization error is like for the Brownian motion. Several methods to construct some rate-optimal quantizers...