Author:
Rachev S. T.,Rüschendorf L.
Abstract
It is shown by means of several examples that probability metrics are a useful tool to study the asymptotic behaviour of (stochastic) recursive algorithms. The basic idea of this approach is to find a ‘suitable' probability metric which yields contraction properties of the transformations describing the limits of the algorithm. In order to demonstrate the wide range of applicability of this contraction method we investigate examples from various fields, some of which have already been analysed in the literature.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference37 articles.
1. Rate of convergence for sums and maxima and doubly ideal metrics;Rachev;Theory Prob. Appl.,1992
2. Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces
3. On limit distributions of random symmetric polynomials;Seidel;Theory Prob. Appl.,1988
Cited by
71 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献