No label defined (Q4725409)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3998862
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3998862 |
Statements
1985
0 references
allocation scheme
0 references
exact formulas for the generating functions
0 references
asymptotic results
0 references
0.8702077269554138
0 references
[For the entire collection see Zbl 0606.00024.] A random allocation scheme according to two given natural-valued sequences of random variables \(\{\eta_ m\}\) and \(\{\zeta_ m\}\) is considered. At the first step \(\zeta_ 1\) particles are thrown into the \(\eta_ 1th\) cell, then \(\zeta_ 2\) particles are thrown into the \(\eta_ 2th\) cell and so on. \(\{\eta_ m\}\) are supposed to form a simple Markov chain such that \(P(\eta_ 1=i)=N^{-1}\), \(P(\eta_{m+1}=j\neq i| \eta_ m=i)=(N-1)^{-1}\), \(i,j=1,...,N\), \(m=1,2,...\), and, in addition, \(\{\zeta_ m\}\) are i.i.d. random variables with a given distribution function. Two characteristics of this scheme are investigated, namely, the number of allocated particles until k different cells are occupied and the number of all empty cells after the allocation of n particles. The authors obtain exact formulas for the generating functions of these characteristics as well as asymptotic results in some particular case.
0 references