Limit theorems for mergesort
β Scribed by Hsien-Kuei Hwang
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 669 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
Central and local limit theorems (including large deviations) are established for the number of comparisons used by the standard top-down recursive mergesort under the uniform permutation model. The method of proof utilizes Dirichlet series, Mellin transforms, and standard analytic methods in probability theory.
π SIMILAR VOLUMES
We consider limit theorems for counting processes generated by Minkowski sums of random fuzzy sets. Using support functions, we prove almost-sure convergence for a renewal process indexed by fuzzy sets in an inner-product vector space. We also get convergence for the associated containment renewal f
We prove the strong law of large numbers for logarithmic averages of random vectors. We also obtain a strong approximation for logarithmic averages. for a large class of functions a if d = 1. Earlier results are due to [IS] and [12] when a(t) = I { t 5 0). For extensions of (1.3) we refer to [17],
## Abstract A general almost sure limit theorem is presented for random fields. It is applied to obtain almost sure versions of some (functional) central limit theorems. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)