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
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Limit laws for two distance-based indices in random recursive tree models;Acta Universitatis Sapientiae, Informatica;2022-08-01
2. Stochastic fixed-point equations;Stochastic Models;2019-03-05
3. On the size of paged recursive trees;Discrete Mathematics, Algorithms and Applications;2017-04
4. DEGREE PROFILE OF HIERARCHICAL LATTICE NETWORKS;Probability in the Engineering and Informational Sciences;2016-09-13
5. The Weighted Branching Process;Branching Processes and Their Applications;2016