## The Annals of Probability

### On the contraction method with degenerate limit equation

#### Abstract

A class of random recursive sequences (Yn) with slowly varying variances as arising for parameters of random trees or recursive algorithms leads after normalizations to degenerate limit equations of the form . For nondegenerate limit equations the contraction method is a main tool to establish convergence of the scaled sequence to the “unique” solution of the limit equation. In this paper we develop an extension of the contraction method which allows us to derive limit theorems for parameters of algorithms and data structures with degenerate limit equation. In particular, we establish some new tools and a general convergence scheme, which transfers information on mean and variance into a central limit law (with normal limit). We also obtain a convergence rate result. For the proof we use selfdecomposability properties of the limit normal distribution which allow us to mimic the recursive sequence by an accompanying sequence in normal variables.

#### Article information

Source
Ann. Probab., Volume 32, Number 3B (2004), 2838-2856.

Dates
First available in Project Euclid: 6 August 2004

https://projecteuclid.org/euclid.aop/1091813632

Digital Object Identifier
doi:10.1214/009117904000000171

Mathematical Reviews number (MathSciNet)
MR2023025

Zentralblatt MATH identifier
1060.60005

#### Citation

Neininger, Ralph; Rüschendorf, Ludger. On the contraction method with degenerate limit equation. Ann. Probab. 32 (2004), no. 3B, 2838--2856. doi:10.1214/009117904000000171. https://projecteuclid.org/euclid.aop/1091813632

#### References

• Chen, W.-M. and Hwang, H.-K. (2003). Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model. J. Algorithms 46 140--177.
• Cramer, M. and Rüschendorf, L. (1996). Analysis of recursive algorithms by the contraction method. Athens Conference on Applied Probability and Time Series Analysis. Lecture Notes in Statist. 114 18--33. Springer, New York.
• Fill, J. A., Mahmoud, H. and Szpankowski, W. (1996). On the distribution for the duration of a randomized leader election algorithm. Ann. Appl. Probab. 6 1260--1283.
• Hwang, H.-K. and Tsai, T.-H. (2002). Quickselect and Dickman function. Combin. Probab. Comput. 11 353--371.
• Mahmoud, H. M. (1992). Evolution of Random Search Trees. Wiley, New York.
• Mahmoud, H. M. and Neininger, R. (2003). Distribution of distances in random binary search trees. Ann. Appl. Probab. 13 253--276.
• Neininger, R. and Rüschendorf, L. (2002). Rates of convergence for Quicksort. J. Algorithms 44 52--62.
• Neininger, R. and Rüschendorf, L. (2004). A general limit theorem for recursive algorithms and combinatorial structures. Ann. Appl. Probab. 14 378--418.
• Prodinger, H. (1993). How to select a loser. Discrete Math. 120 149--159.
• Rachev, S. T. (1991). Probability Metrics and the Stability of Stochastic Models. Wiley, New York.
• Rachev, S. T. and Rüschendorf, L. (1995). Probability metrics and recursive algorithms. Adv. in Appl. Probab. 27 770--799.
• Rösler, U. (1991). A limit theorem for Quicksort.'' RAIRO Inform. Théor. Appl. 25 85--100.
• Rösler, U. (1992). A fixed point theorem for distributions. Stochastic Process. Appl. 42 195--214.
• Rösler, U. (2001). On the analysis of stochastic divide and conquer algorithms. Algorithmica 29 238--261.
• Rösler, U. and Rüschendorf, L. (2001). The contraction method for recursive algorithms. Algorithmica 29 3--33.
• Zolotarev, V. M. (1976). Approximation of the distributions of sums of independent random variables with values in infinite-dimensional spaces. Theory Probab. Appl. 21 721--737.
• Zolotarev, V. M. (1977). Ideal metrics in the problem of approximating distributions of sums of independent random variables. Theory Probab. Appl. 22 433--449.