Approximation by a binomial type law (Q1324855)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation by a binomial type law |
scientific article; zbMATH DE number 578646
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation by a binomial type law |
scientific article; zbMATH DE number 578646 |
Statements
Approximation by a binomial type law (English)
0 references
19 July 1994
0 references
We define ``probabilities'' (measures) of a binomial type (b.t.) distribution by \[ p_{n,k} = {n! \over k! (n-k)!} p_ 0^{n-k} p^ k_ 1, \quad k=0,1, \dots, n,\;n=1,2,\dots,\;p_ 0 + p_ 1 \leq 1,\;p_ 0, p_ 1 \geq 0. \tag{1} \] The generating function is equal to \((p_ 0 + p_ 1z)^ n\). B. t. ``probabilities'' can serve as approximations for probabilities of sums of \(n\) independent identically distributed lattice random variables (r.v.'s). This is the problem investigated in the paper. Consider a r.v. \(X\) taking values \(k=0,1,\dots\), having the maximal step of distribution equal to 1 and corresponding probabilities \(p_ k\), \(0<p_ 1 \leq p_ 0\). For generality we also consider further the probabilities \(p_{n,k}\) of the sum \(X_ n\) of \(n\) independent copies of the r.v. \(X\), \(n=1,2 \dots\). Such sums often appear in applications.
0 references
numerical characteristic
0 references
generating function
0 references
approximations
0 references