Bahadur Efficiency of Rank Tests for the Change-Point Problem
Praagman, Jaap
Ann. Statist., Tome 16 (1988) no. 1, p. 198-217 / Harvested from Project Euclid
A sequence of independent random variables $X_1, X_2, \cdots, X_N$ is said to have a change point if $X_1, X_2, \cdots, X_n$ have a common distribution $F$ and $X_{n+1}, \cdots, X_N$ have a common distribution $G, G \neq F$. Consider the problem of testing the null hypothesis of no change against the alternative of a change $G < F$ at an unknown change point $n$. Two classes of statistics based upon two-sample linear rank statistics (max- and sum-type) are compared in terms of their Bahadur efficiency. It is shown that for every sequence of sum-type statistics a sequence of max-type statistics can be constructed with at least the same Bahadur slope at all possible alternatives. Special attention is paid to alternatives close to the null hypothesis.
Publié le : 1988-03-14
Classification:  Bahadur efficiency,  linear rank test,  change-point test,  62G20,  62G10
@article{1176350700,
     author = {Praagman, Jaap},
     title = {Bahadur Efficiency of Rank Tests for the Change-Point Problem},
     journal = {Ann. Statist.},
     volume = {16},
     number = {1},
     year = {1988},
     pages = { 198-217},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1176350700}
}
Praagman, Jaap. Bahadur Efficiency of Rank Tests for the Change-Point Problem. Ann. Statist., Tome 16 (1988) no. 1, pp.  198-217. http://gdmltest.u-ga.fr/item/1176350700/