|
Decomposable statistics in an inverse occupancy problem
G. I. Ivchenko
Abstract:
We consider a process of the sequential equiprobable allocation of particles among N cells. We assume that up to the start of the trials for cell number j a level νj, j=1,…,N, was established, where ν1,…,νN are independent identically distributed integer random variables. We carry out the trials until the moment when k cells appear for the first time and their contents reach or exceed the corresponding levels. We study the decomposable statistics
LN,k=N∑j=1g(ηj),
where g is some function of an integer argument, and ηj is the content of the j-th cell at the moment when the observations cease. We present a general method that reduces the problem of studying the random variables LN,k to the study of the sums of conditionally independent random variables. Using this approach we succeed in obtaining a sufficiently complete description of a class of limit distributions of decomposable statistics in a scheme of equiprobable allocation as N→∞ and under various modes of change in the parameter k.
Received: 05.09.1988
Citation:
G. I. Ivchenko, “Decomposable statistics in an inverse occupancy problem”, Diskr. Mat., 1:1 (1989), 60–73; Discrete Math. Appl., 1:1 (1991), 81–96
Linking options:
https://www.mathnet.ru/eng/dm897 https://www.mathnet.ru/eng/dm/v1/i1/p60
|
Statistics & downloads: |
Abstract page: | 443 | Full-text PDF : | 163 | References: | 1 | First page: | 3 |
|