Journal Article10.2307/1428133
Probability metrics and recursive algorithms
121
TL;DR: It is shown by means of several examples that probability metrics are a useful tool to study the asymptotic behaviour of (stochastic) recursive algorithms and their contraction properties of the transformations describing the limits of the algorithm.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The ζ (2) limit in the random assignment problem
TL;DR: Aldous and DJ as discussed by the authors constructed the optimal matching on the infinite tree, which yields a rigorous proof of the ζ(2) limit and of the conjectured limit distribution of edge-costs and their rank-orders in the optimal bipartite matching.
340
The contraction method for recursive algorithms
Uwe Rösler,Ludger Rüschendorf +1 more
TL;DR: A new quite general model for branching dynamical systems is introduced and the contraction method can be applied in this model and this model includes many classical examples of random trees and gives a general frame for further applications.
193
On a multivariate contraction method for random recursive structures with applications to Quicksort
TL;DR: A general multivariate limit law is proved, which also leads to an approach to asymptotic covariances and correlations of the parameters, and a bivariate limitLaw for the number of key comparisons and exchanges of median-of-(2t+1) Quicksort.
The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
TL;DR: In this article, the Sackin statistic was studied under the Yule and uniform model of phylogenetic trees, and asymptotics for the mean, variance and covariance of these two statistics were obtained, as well as their limiting joint distribution for large phylogenies.
84
Polya urns via the contraction method
Margarete Knape,Ralph Neininger +1 more
TL;DR: An approach to analysing the asymptotic behaviour of Pólya urns based on the contraction method is proposed and a new combinatorial discrete-time embedding of the evolution of the urn into random rooted trees is developed.
References
Stochastic Analysis: The Continuum random tree II: an overview
D. Aldous
- 01 Oct 1991
TL;DR: In this paper, the authors discuss aspects of this incipient general theory which are most closely related to topics of current interest in theoretical stochastic processes, aimed at theoretical probabilists.
On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
TL;DR: In this paper, the authors considered the stochastic difference equation Y n = A n Y n-1 + B n with i.i.d. random pairs (A n, B n ) and obtained conditions under which Y n converges in distribution.
509
On a stochastic difference equation and a representation of non-negative
Wim Vervaat
- 01 Jan 1979
TL;DR: In this article, the stochastic difference equation Y, =AY_-1+B, with i.i.d. random pairs (An,B) was considered and conditions under which Y converges in distribution.
409