In statistics the Cramér–von Mises criterion is a criterion used for judging the goodness of fit of a cumulative distribution function
F
∗
compared to a given empirical distribution function
F
n
, or for comparing two empirical distributions. It is also used as a part of other algorithms, such as minimum distance estimation. It is defined as
ω
2
=
∫
−
∞
∞
[
F
n
(
x
)
−
F
∗
(
x
)
]
2
d
F
∗
(
x
)
In one-sample applications
F
∗
is the theoretical distribution and
F
n
is the empirically observed distribution. Alternatively the two distributions can both be empirically estimated ones; this is called the two-sample case.
The criterion is named after Harald Cramér and Richard Edler von Mises who first proposed it in 1928–1930. The generalization to two samples is due to Anderson.
The Cramér–von Mises test is an alternative to the Kolmogorov–Smirnov test.
Let
x
1
,
x
2
,
⋯
,
x
n
be the observed values, in increasing order. Then the statistic is
T
=
n
ω
2
=
1
12
n
+
∑
i
=
1
n
[
2
i
−
1
2
n
−
F
(
x
i
)
]
2
.
If this value is larger than the tabulated value, then the hypothesis that the data come from the distribution
F
can be rejected.
A modified version of the Cramér–von Mises test is the Watson test which uses the statistic U2, where
U
2
=
T
−
n
(
F
¯
−
1
2
)
2
,
where
F
¯
=
1
n
∑
F
(
x
i
)
.
Let
x
1
,
x
2
,
⋯
,
x
N
and
y
1
,
y
2
,
⋯
,
y
M
be the observed values in the first and second sample respectively, in increasing order. Let
r
1
,
r
2
,
⋯
,
r
N
be the ranks of the x's in the combined sample, and let
s
1
,
s
2
,
⋯
,
s
M
be the ranks of the y's in the combined sample. Anderson shows that
T
=
N
ω
2
=
U
N
M
(
N
+
M
)
−
4
M
N
−
1
6
(
M
+
N
)
where U is defined as
U
=
N
∑
i
=
1
N
(
r
i
−
i
)
2
+
M
∑
j
=
1
M
(
s
j
−
j
)
2
If the value of T is larger than the tabulated values, the hypothesis that the two samples come from the same distribution can be rejected. (Some books give critical values for U, which is more convenient, as it avoids the need to compute T via the expression above. The conclusion will be the same).
The above assumes there are no duplicates in the
x
,
y
, and
r
sequences. So
x
i
is unique, and its rank is
i
in the sorted list
x
1
,
.
.
.
x
N
. If there are duplicates, and
x
i
through
x
j
are a run of identical values in the sorted list, then one common approach is the midrank method: assign each duplicate a "rank" of
(
i
+
j
)
/
2
. In the above equations, in the expressions
(
r
i
−
i
)
2
and
(
s
j
−
j
)
2
, duplicates can modify all four variables
r
i
,
i
,
s
j
, and
j
.
