Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution (Q308957)
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: Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution |
scientific article |
Statements
Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution (English)
0 references
6 September 2016
0 references
analysis of algorithms
0 references
random sampling
0 references
anticipated rejection
0 references
limit distribution
0 references
sum of i.i.d. random variables
0 references
Darling-Mandelbrot distribution
0 references
0 references
0.9898002743721008
0 references
0.6849786043167114
0 references
0.6788129210472107
0 references
0.6783353686332703
0 references
0.6777814030647278
0 references
