✦ LIBER ✦

Limit theorems for recursive algorithms

✍ Scribed by P Feldman; S.T Rachev; L Rüschendorf

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 769 KB
Volume: 56
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(94)90386-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit theorems for mergesort

✍ Hsien-Kuei Hwang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 669 KB

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 probab

Limit theorems for logarithmic means

✍ A.O Pittenger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Limit theorems for cumulative processes

✍ Peter W. Glynn; Ward Whitt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Limit theorems for multitype epidemics

✍ Håkan Andersson; Boualem Djehiche 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Limit theorems for polylinear forms

✍ V.I Rotar' 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Limit theorems for rank statistics

✍ M. Hušková 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 363 KB

The purpose of the paper is to extend the weak asymptotic results for the weighted partial sums of i.i.d, random variables to the weighted partial sums of rank scores. These results then suggest various test procedures for the change point problem. The crucial tools in the proofs are martingale pro