z-logo
open-access-imgOpen Access
The Power of the Optimal Asymptotic Tests of Composite Statistical Hypotheses
Author(s) -
Avinash Singh,
I. G. Žhurbenko
Publication year - 1975
Publication title -
proceedings of the national academy of sciences of the united states of america
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 5.011
H-Index - 771
eISSN - 1091-6490
pISSN - 0027-8424
DOI - 10.1073/pnas.72.2.577
Subject(s) - mathematics , rate of convergence , simple (philosophy) , combinatorics , beta (programming language) , infinity , zero (linguistics) , statistics , order (exchange) , convergence (economics) , statistical hypothesis testing , limit (mathematics) , ratio test , mathematical analysis , computer science , computer network , philosophy , channel (broadcasting) , linguistics , epistemology , economics , economic growth , finance , programming language
The easily computable asymptotic power of the locally asymptotically optimal test of a composite hypothesis, known as the optimalC (α) test, is obtained through a “double” passage to the limit: the numbern of observations is indefinitely increased while the conventional measure ξ of the error in the hypothesis tested tends to zero so that ξn n ½ → τ ≠ 0. Contrary to this, practical problems require information on power, say β(ξ,n ), for a fixed ξ and for a fixedn . The present paper gives the upper and the lower bounds for β(ξ,n ). These bounds can be used to estimate the rate of convergence of β(ξ,n ) to unity asn → ∞. The results obtained can be extended to test criteria other than those labeledC (α). The study revealed a difference between situations in which theC (α) test criterion is used to test a simple or a composite hypothesis. This difference affects the rate of convergence of the actual probability of type I error to the preassigned level α. In the case of a simple hypothesis, the rate is of the order ofn -½ . In the case of a composite hypothesis, the best that it was possible to show is that the rate of convergence cannot be slower than that of the order ofn -½ lnn .

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here