Probability metrics and recursive algorithms

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.

[1]  J. Wrench.  Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[2]  V. Zolotarev.  Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces , 1977 .

[3]  W. Vervaat.  On a stochastic difference equation and a representation of non–negative infinitely divisible random variables , 1979, Advances in Applied Probability.

[4]  D. Freedman,et al.  Some Asymptotic Theory for the Bootstrap , 1981 .

[5]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[6]  S. Ross.  A Simple Heuristic Approach to Simplex Efficiency. , 1982 .

[7]  Rainer Kemp,et al.  Fundamentals of the average case analysis of particular algorithms , 1985, Wiley-Teubner series in computer science.

[8]  GUY FAYOLLE,et al.  Analysis of a stack algorithm for random multiple-access communication , 1985, IEEE Trans. Inf. Theory.

[9]  S. Rachev.  The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications , 1985 .

[10]  S. Rachev,et al.  Rate of convergence in limit theorems for the max-scheme , 1985 .

[11]  Micha Hofri,et al.  On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel , 1986 .

[12]  Luc Devroye,et al.  Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.

[13]  Georg Ch. Pflug.  Stochastische Modelle in der Informatik , 1986 .

[14]  B. Pittel.  Paths in a random digital tree: limiting distributions , 1986, Advances in Applied Probability.

[15]  Mireille Régnier,et al.  Normal Limiting Distribution of the Size of Tries , 1987, Performance.

[16]  Micha Hofri,et al.  Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.

[17]  Svetlozar T. Rachev,et al.  An Ideal Metric and the Rate of Convergence to a Self-Similar Process , 1987 .

[18]  Kurt Mehlhorn.  Datenstrukturen und effiziente Algorithmen , 1988 .

[19]  M. Barnsley,et al.  A new class of markov processes for image encoding , 1988, Advances in Applied Probability.

[20]  P. Deheuvels,et al.  On a relationship between Uspensky's theorem and poisson approximations , 1988 .

[21]  Central limit theorems for generalized multilinear forms , 1990 .

[22]  J. Yukich,et al.  Rates for the CLT Via New Ideal Metrics , 1989 .

[23]  On Limit Distributions of Random Symmetric Polynomials , 1989 .

[24]  Mireille Régnier,et al.  New results on the size of tries , 1989, IEEE Trans. Inf. Theory.

[25]  Svetlozar T. Rachev,et al.  Estimates of the Rate of Convergence for Max-Stable Processes , 1989 .

[26]  Svetlozar T. Rachev,et al.  Approximation of sums by compound Poisson distributions with respect to stop-loss distances , 1990 .

[27]  On the rate of convergence of some functionals of a stochastic process , 1990 .

[28]  Rudolf Mathar,et al.  Stochastik für Informatiker , 1990, Leitfäden und Monographien der Informatik.

[29]  D. Aldous.  Stochastic Analysis: The Continuum random tree II: an overview , 1991 .

[30]  D. Pfeifer.  Some remarks on nevzorov's record model , 1991, Advances in Applied Probability.

[31]  U. Rösler.  A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..

[32]  G. Pflug,et al.  The asymptotic contour process of a binary tree is a Brownian excursion , 1992 .

[33]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[34]  S. Rachev,et al.  Rate of Convergence for Sums and Maxima and Doubly Ideal Metrics , 1993 .