No label defined (Q4532115)
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 1746533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1746533 |
Statements
28 May 2002
0 references
simulation of 1D finite probability densities
0 references
two-side rejection method
0 references
beta-distribution
0 references
algorithm
0 references
0.7780106663703918
0 references
0.7718639373779297
0 references
0.7701978087425232
0 references
0.7669813632965088
0 references
0.7652098536491394
0 references
The author exposes an algorithm for constructing piecewise linear functions \(g_+(x)\) and \(g_-(x)\) which approximate a given finite probability density \(p(x)\) with an arbitrary accuracy. Let \(M\) denotes the number of grid intervals in \(x\) which are used for constructing piecewise linear functions. The algorithm proposed possesses the following properties: \[ \langle g_+ \rangle (M)= 1 + e_+(M),\quad \langle g_- \rangle (M) = 1 - e_-(M),\quad \tau[g](M) \approx \text{const}, \] where \(\tau[g](M)\) is the time for modeling a random variable, \(\langle g_+ \rangle (M)\) and \(\langle g_- \rangle (M) \) tend to zero as \(M\to\infty\). The algorithm is investigated in detail for the beta-distribution with nonnegative parameters. Moreover, a modification of the algorithm is presented both for infinite densities and infinite intervals.
0 references