Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 | 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 2x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 956x 1176x 1176x 772x 772x 772x 772x 1176x 258x 1176x 146x 146x 146x 146x 404x 404x 1176x 8x 8x 8x 396x 396x 1176x 202x 202x 202x 202x 202x 202x 202x 202x 34x 34x 202x 106x 106x 106x 106x 106x 46x 46x 106x 1176x 194x 194x 83x 567x 567x 194x 96x 681x 681x 96x 194x 104x 104x 194x 1176x 956x 2x 2x 2x 2x 2x | /**
* @license Apache-2.0
*
* Copyright (c) 2018 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var floor = require( '@stdlib/math/base/special/floor' );
var sign = require( '@stdlib/math/base/special/signum' );
var sqrt = require( '@stdlib/math/base/special/sqrt' );
var abs = require( '@stdlib/math/base/special/abs' );
var ln = require( '@stdlib/math/base/special/ln' );
var correction = require( './correction.js' );
// VARIABLES //
var ONE_SIXTH = 1.0 / 6.0;
// MAIN //
/**
* Generates a binomially distributed pseudorandom number.
*
* ## References
*
* - Hörmann, Wolfgang. 1993. "The generation of binomial random variates." _Journal of Statistical Computation and Simulation_ 46 (1-2): 101–10. doi:[10.1080/00949659308811496][@hormann:1993a].
*
* [@hormann:1993a]: http://dx.doi.org/10.1080/00949659308811496
*
* @private
* @param {PRNG} rand - PRNG for uniformly distributed numbers
* @param {PositiveInteger} n - number of trials
* @param {Probability} p - success probability
* @returns {NonNegativeInteger} pseudorandom number
*/
function sample( rand, n, p ) {
var alpha;
var urvr;
var snpq;
var npq;
var rho;
var tmp;
var nm;
var nr;
var us;
var km;
var nk;
var vr;
var a;
var b;
var c;
var f;
var h;
var i;
var k;
var m;
var q;
var r;
var t;
var u;
var v;
var x;
m = floor( (n + 1) * p );
nm = n - m + 1;
q = 1.0 - p;
r = p / q;
nr = (n + 1) * r;
npq = n * p * q;
snpq = sqrt( npq );
b = 1.15 + (2.53 * snpq);
a = -0.0873 + (0.0248*b) + (0.01*p);
c = (n*p) + 0.5;
alpha = (2.83 + (5.1/b)) * snpq;
vr = 0.92 - (4.2/b);
urvr = 0.86 * vr;
h = (m + 0.5) * ln( (m+1) / (r*nm) );
h += correction( m ) + correction( n-m );
while ( true ) {
v = rand();
if ( v <= urvr ) {
u = (v/vr) - 0.43;
r = (u * ( (2.0*a / (0.5 - abs(u))) + b )) + c;
return floor( r );
}
if ( v >= vr ) {
u = rand() - 0.5;
} else {
u = (v/vr) - 0.93;
u = (sign( u ) * 0.5) - u;
v = vr * rand();
}
us = 0.5 - abs(u);
k = floor( (u * ( (2.0*a/us) + b )) + c );
if ( k < 0 || k > n ) {
// Try again...
continue;
}
v = v * alpha / ( (a/(us*us)) + b );
km = abs( k - m );
if ( km > 15 ) {
v = ln( v );
rho = km / npq;
tmp = ( (km/3) + 0.625 ) * km;
tmp += ONE_SIXTH;
tmp /= npq;
rho *= tmp + 0.5;
t = -(km * km) / (2.0 * npq);
if ( v < t - rho ) {
return k;
}
if ( v <= t + rho ) {
nk = n - k + 1;
x = h + ( (n+1)*ln( nm/nk ) );
x += (k+0.5) * ln( nk*r/(k+1) );
x += -(correction( k ) + correction( n-k ));
if ( v <= x ) {
return k;
}
}
} else {
f = 1.0;
if ( m < k ) {
for ( i = m; i <= k; i++ ) {
f *= (nr/i) - r;
}
} else if ( m > k ) {
for ( i = k; i <= m; i++ ) {
v *= (nr/i) - r;
}
}
if ( v <= f ) {
return k;
}
}
}
}
// EXPORTS //
module.exports = sample;
|