๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strong approximation of the number of renewal paced record times

โœ Scribed by Gratiane Ennadifi

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
624 KB
Volume
45
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Normal approximations of the number of r
Normal approximations of the number of records in geometrically distributed random variables
โœ Zhi-Dong Bai; Hsien-Kuei Hwang; Wen-Qi Liang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 217 KB ๐Ÿ‘ 2 views

We establish the asymptotic normality of the number of upper records in a sequence of iid geometric random variables. Large deviations and local limit theorems as well as approximation theorems for the number of lower records are also derived. แฎŠ 1998

A polynomial-time algorithm to approxima
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
โœ Mary Cryan; Martin Dyer ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 232 KB

We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows (Random Structures Algorithms 10(4) (1997) 487). In this paper we present the first fully polynomial randomized approximatio