Mathematics – Probability
Scientific paper
2004-10-06
Annals of Probability 2004, Vol. 32, No. 3B, 2838-2856
Mathematics
Probability
Published by the Institute of Mathematical Statistics (http://www.imstat.org) in the Annals of Probability (http://www.imsta
Scientific paper
10.1214/009117904000000171
A class of random recursive sequences (Y_n) with slowly varying variances as arising for parameters of random trees or recursive algorithms leads after normalizations to degenerate limit equations of the form X\stackrel{L}{=}X. 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.
Neininger Ralph
Rüschendorf Ludger
No associations
LandOfFree
On the contraction method with degenerate limit equation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the contraction method with degenerate limit equation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the contraction method with degenerate limit equation will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-171362