|
Packit |
67cb25 |
/* randist/poisson.c
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* Copyright (C) 1996, 1997, 1998, 1999, 2000, 2007 James Theiler, Brian Gough
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is free software; you can redistribute it and/or modify
|
|
Packit |
67cb25 |
* it under the terms of the GNU General Public License as published by
|
|
Packit |
67cb25 |
* the Free Software Foundation; either version 3 of the License, or (at
|
|
Packit |
67cb25 |
* your option) any later version.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* This program is distributed in the hope that it will be useful, but
|
|
Packit |
67cb25 |
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
Packit |
67cb25 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Packit |
67cb25 |
* General Public License for more details.
|
|
Packit |
67cb25 |
*
|
|
Packit |
67cb25 |
* You should have received a copy of the GNU General Public License
|
|
Packit |
67cb25 |
* along with this program; if not, write to the Free Software
|
|
Packit |
67cb25 |
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
Packit |
67cb25 |
*/
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
#include <config.h>
|
|
Packit |
67cb25 |
#include <math.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_sf_gamma.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_rng.h>
|
|
Packit |
67cb25 |
#include <gsl/gsl_randist.h>
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* The poisson distribution has the form
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
p(n) = (mu^n / n!) exp(-mu)
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for n = 0, 1, 2, ... . The method used here is the one from Knuth. */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
unsigned int
|
|
Packit |
67cb25 |
gsl_ran_poisson (const gsl_rng * r, double mu)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
double emu;
|
|
Packit |
67cb25 |
double prod = 1.0;
|
|
Packit |
67cb25 |
unsigned int k = 0;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
while (mu > 10)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
unsigned int m = mu * (7.0 / 8.0);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
double X = gsl_ran_gamma_int (r, m);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
if (X >= mu)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
return k + gsl_ran_binomial (r, mu / X, m - 1);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
else
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
k += m;
|
|
Packit |
67cb25 |
mu -= X;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
/* This following method works well when mu is small */
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
emu = exp (-mu);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
do
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
prod *= gsl_rng_uniform (r);
|
|
Packit |
67cb25 |
k++;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
while (prod > emu);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return k - 1;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
void
|
|
Packit |
67cb25 |
gsl_ran_poisson_array (const gsl_rng * r, size_t n, unsigned int array[],
|
|
Packit |
67cb25 |
double mu)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
size_t i;
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
for (i = 0; i < n; i++)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
array[i] = gsl_ran_poisson (r, mu);
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
return;
|
|
Packit |
67cb25 |
}
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
double
|
|
Packit |
67cb25 |
gsl_ran_poisson_pdf (const unsigned int k, const double mu)
|
|
Packit |
67cb25 |
{
|
|
Packit |
67cb25 |
double p;
|
|
Packit |
67cb25 |
double lf = gsl_sf_lnfact (k);
|
|
Packit |
67cb25 |
|
|
Packit |
67cb25 |
p = exp (log (mu) * k - lf - mu);
|
|
Packit |
67cb25 |
return p;
|
|
Packit |
67cb25 |
}
|