NAG Library Routine Document
g01ezf (prob_kolmogorov2)
1
Purpose
g01ezf returns the probability associated with the upper tail of the Kolmogorov–Smirnov two sample distribution.
2
Specification
Fortran Interface
Real (Kind=nag_wp) | :: | g01ezf | Integer, Intent (In) | :: | n1, n2 | Integer, Intent (Inout) | :: | ifail | Real (Kind=nag_wp), Intent (In) | :: | d |
|
C Header Interface
#include <nagmk26.h>
double |
g01ezf_ (const Integer *n1, const Integer *n2, const double *d, Integer *ifail) |
|
3
Description
Let and denote the empirical cumulative distribution functions for the two samples, where and are the sizes of the first and second samples respectively.
The function
g01ezf computes the upper tail probability for the Kolmogorov–Smirnov two sample two-sided test statistic
, where
The probability is computed exactly if
and
using a method given by
Kim and Jenrich (1973). For the case where
of the
and
the Smirnov approximation is used. For all other cases the Kolmogorov approximation is used. These two approximations are discussed in
Kim and Jenrich (1973).
4
References
Conover W J (1980) Practical Nonparametric Statistics Wiley
Feller W (1948) On the Kolmogorov–Smirnov limit theorems for empirical distributions Ann. Math. Statist. 19 179–181
Kendall M G and Stuart A (1973) The Advanced Theory of Statistics (Volume 2) (3rd Edition) Griffin
Kim P J and Jenrich R I (1973) Tables of exact sampling distribution of the two sample Kolmogorov–Smirnov criterion Selected Tables in Mathematical Statistics 1 80–129 American Mathematical Society
Siegel S (1956) Non-parametric Statistics for the Behavioral Sciences McGraw–Hill
Smirnov N (1948) Table for estimating the goodness of fit of empirical distributions Ann. Math. Statist. 19 279–281
5
Arguments
- 1: – IntegerInput
-
On entry: the number of observations in the first sample, .
Constraint:
.
- 2: – IntegerInput
-
On entry: the number of observations in the second sample, .
Constraint:
.
- 3: – Real (Kind=nag_wp)Input
-
On entry: the test statistic , for the two sample Kolmogorov–Smirnov goodness-of-fit test, that is the maximum difference between the empirical cumulative distribution functions (CDFs) of the two samples.
Constraint:
.
- 4: – IntegerInput/Output
-
On entry:
ifail must be set to
,
. If you are unfamiliar with this argument you should refer to
Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
is recommended. If the output of error messages is undesirable, then the value
is recommended. Otherwise, if you are not familiar with this argument, the recommended value is
.
When the value is used it is essential to test the value of ifail on exit.
On exit:
unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
-
On entry, and .
Constraint: and .
-
On entry, or : .
-
The Smirnov approximation used for large samples did not converge in iterations. The probability is set to .
An unexpected error has been triggered by this routine. Please
contact
NAG.
See
Section 3.9 in How to Use the NAG Library and its Documentation for further information.
Your licence key may have expired or may not have been installed correctly.
See
Section 3.8 in How to Use the NAG Library and its Documentation for further information.
Dynamic memory allocation failed.
See
Section 3.7 in How to Use the NAG Library and its Documentation for further information.
7
Accuracy
The large sample distributions used as approximations to the exact distribution should have a relative error of less than 5% for most cases.
8
Parallelism and Performance
g01ezf is not threaded in any implementation.
The upper tail probability for the one-sided statistics, or , can be approximated by halving the two-sided upper tail probability returned by g01ezf, that is . This approximation to the upper tail probability for either or is good for small probabilities, (e.g., ) but becomes poor for larger probabilities.
The time taken by the routine increases with and , until or . At this point one of the approximations is used and the time decreases significantly. The time then increases again modestly with and .
10
Example
The following example reads in different sample sizes and values for the test statistic . The upper tail probability is computed and printed for each case.
10.1
Program Text
Program Text (g01ezfe.f90)
10.2
Program Data
Program Data (g01ezfe.d)
10.3
Program Results
Program Results (g01ezfe.r)