Journal Article10.1007/BF02679611
The contraction method for recursive algorithms
Uwe Rösler,Ludger Rüschendorf +1 more
193
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.
read more
Abstract: In this paper we give an introduction to the analysis of algorithms by the contraction method. By means of this method several interesting classes of recursions can be analyzed as particular cases of our general framework. We introduce the main steps of this technique which is based on contraction properties of the algorithm with respect to suitable probability metrics. Typically the limiting distribution is characterized as a fixed point of a limiting operator on the class of probability distributions. We explain this method in the context of several “divide and conquer” algorithms. In the second part of the paper we introduce a new quite general model for branching dynamical systems and explain that the contraction method can be applied in this model. This model includes many classical examples of random trees and gives a general frame for further applications.
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
A survey of max-type recursive distributional equations
David Aldous,Antar Bandyopadhyay +1 more
TL;DR: In this paper, the authors consider the problem of endogeny in the recursive tree process X_i and draw attention to the theoretical question of whether the X-i measurable functions of the innovations process (X_i) are also measurable in the tree process.
A survey of max-type recursive distributional equations
David Aldous,Antar Bandyopadhyay +1 more
TL;DR: In this paper, the authors consider the problem of endogeny in the recursive tree process Xi, where the Xi measurable functions of the innovations process (ξi) are given and the Xi are independent copies of the unknown distribution X.
Continuum percolation with steps in the square or the disc
TL;DR: In this paper, the critical area for percolation in the Gaussian model was shown to lie between 4.508 and 4.515, with 99.99p confidence.
202
Chapter 4 Nonuniform Random Variate Generation
TL;DR: This chapter provides a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject, before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods.
124
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.
References
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
TL;DR: A container closure assembly for maintaining a sterile sealed container is provided having a ferrule having a central opening in the top annular portion, upwardly projecting locking portions about the periphery of the opening and a weakening line radially outwardly of and concentric with the locking portions.
2.8K
•Book
Limit Distributions for Sums of Independent Random Variables
B. W. Gnedenko,A. N. Kolmogorov +1 more
- 01 Jan 1954
2.3K
Quad trees a data structure for retrieval on composite keys
TL;DR: An optimized tree is defined and an algorithm to accomplish optimization in n log n time is presented, guaranteeing that Searching is guaranteed to be fast in optimized trees.
2.2K
Random difference equations and Renewal theory for products of random matrices
TL;DR: In this paper, a special case of random walks in a random environment with immigration was studied, where Mn and Qn are random d • d matrices respectively d-vectors and Yn also is a d-vector.