analistica/ex-1/main.c

136 lines
3.3 KiB
C
Raw Normal View History

2020-03-06 02:24:32 +01:00
#include <stdio.h>
#include <stdlib.h>
2020-03-24 02:17:39 +01:00
#include <math.h>
2020-03-06 02:24:32 +01:00
#include <gsl/gsl_randist.h>
#include <gsl/gsl_histogram.h>
2020-03-24 02:41:45 +01:00
#include <gsl/gsl_statistics_double.h>
2020-03-24 02:17:39 +01:00
#include "landau.h"
#include "tests.h"
#include "bootstrap.h"
2020-03-06 02:24:32 +01:00
/* Here we generate random numbers in a uniform
* range and by using the quantile we map them
* to a Landau distribution. Then we generate an
* histogram to check the correctness.
*/
int main(int argc, char** argv) {
// initialize an RNG
gsl_rng_env_setup();
gsl_rng *r = gsl_rng_alloc(gsl_rng_default);
// prepare histogram
size_t samples = 100000;
double* sample = calloc(samples, sizeof(double));
size_t bins = 40;
double min = -20;
double max = 20;
gsl_histogram* hist = gsl_histogram_alloc(bins);
gsl_histogram_set_ranges_uniform(hist, min, max);
2020-03-24 02:17:39 +01:00
/* Sample generation
*
* Sample points from the Landau
* distribution and fill the histogram.
2020-03-06 02:24:32 +01:00
*/
2020-03-24 02:17:39 +01:00
fprintf(stderr, "# Sampling\n");
fprintf(stderr, "generating %ld points... ", samples);
2020-03-06 02:24:32 +01:00
double x;
for(size_t i=0; i<samples; i++) {
x = gsl_ran_landau(r);
sample[i] = x;
gsl_histogram_increment(hist, x);
}
2020-03-24 02:17:39 +01:00
fprintf(stderr, "done\n");
2020-03-06 02:24:32 +01:00
// sort the sample
qsort(sample, samples, sizeof(double), &cmp_double);
2020-03-24 02:17:39 +01:00
/* Kolmogorov-Smirnov test
*
* Compute the D statistic and its
* associated probability.
*/
2020-03-06 02:24:32 +01:00
double D = 0;
double d;
for(size_t i=0; i<samples; i++) {
d = fabs(landau_cdf(sample[i], NULL) - ((double)i+1)/samples);
if (d > D)
D = d;
}
2020-03-24 02:17:39 +01:00
fprintf(stderr, "\n\n# Kolmogorov-Smirnov test\n");
2020-03-06 02:24:32 +01:00
double beta = kolmogorov_cdf(D, samples);
2020-03-24 02:17:39 +01:00
// print the results
fprintf(stderr, "\n## Results\n");
2020-03-06 02:24:32 +01:00
fprintf(stderr, "D: %f\n", D);
fprintf(stderr, "α: %g\n", 1 - beta);
2020-03-24 02:17:39 +01:00
/* Mode comparison
*
* Find the bin with the maximum number of events
*/
2020-04-06 10:32:26 +02:00
2020-03-24 02:17:39 +01:00
fprintf(stderr, "\n\n# Mode comparison\n");
2020-03-06 02:24:32 +01:00
/* A structure used by the optimisation
* routines in numeric_mode and others
* functions below.
*/
gsl_function pdf;
pdf.function = &landau_pdf;
pdf.params = NULL;
double mode_e = numeric_mode(min, max, &pdf);
2020-04-06 10:32:26 +02:00
uncert mode_o = bootstrap_mode(r, sample, samples, 100);
// print the results
2020-03-24 02:17:39 +01:00
fprintf(stderr, "\n## Results\n");
2020-03-06 02:24:32 +01:00
fprintf(stderr, "expected mode: %.7f\n", mode_e);
2020-04-06 10:32:26 +02:00
fprintf(stderr, "observed mode: %.4f±%.4f\n", mode_o.n, mode_o.s);
double t = fabs(mode_e - mode_o.n)/mode_o.s;
double p = 1 - erf(t/sqrt(2));
fprintf(stderr, "\n## t-test\n");
fprintf(stderr, "t=%.3f\n", t);
fprintf(stderr, "p=%.3f\n", p);
2020-03-06 02:24:32 +01:00
2020-03-24 02:17:39 +01:00
/* FWHM comparison
*
* Find the bins x and x.
*/
2020-03-06 02:24:32 +01:00
2020-03-24 02:41:45 +01:00
/* Median comparison
*
* Compute the median of the sample by bootstrapping
* it and comparing it with the QDF(1/2).
2020-03-24 02:41:45 +01:00
*/
fprintf(stderr, "\n\n# Median comparison\n");
double med_e = landau_qdf(0.5);
uncert med_o = bootstrap_median(r, sample, samples, 100);
2020-03-24 02:41:45 +01:00
// print the results
fprintf(stderr, "\n## Results\n");
2020-03-24 02:41:45 +01:00
fprintf(stderr, "expected median: %.7f\n", med_e);
fprintf(stderr, "observed median: %.4f±%.4f\n", med_o.n, med_o.s);
2020-04-06 10:32:26 +02:00
t = fabs(med_e - med_o.n)/med_o.s;
p = 1 - erf(t/sqrt(2));
fprintf(stderr, "\n## t-test\n");
fprintf(stderr, "t=%.3f\n", t);
fprintf(stderr, "p=%.3f\n", p);
2020-03-06 02:24:32 +01:00
// clean up and exit
gsl_histogram_free(hist);
gsl_rng_free(r);
free(sample);
return EXIT_SUCCESS;
}