A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TLDR
In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.Abstract:
In many cases an optimum or computationally convenient test of a simple hypothesis $H_0$ against a simple alternative $H_1$ may be given in the following form. Reject $H_0$ if $S_n = \sum^n_{j=1} X_j \leqq k,$ where $X_1, X_2, \cdots, X_n$ are $n$ independent observations of a chance variable $X$ whose distribution depends on the true hypothesis and where $k$ is some appropriate number. In particular the likelihood ratio test for fixed sample size can be reduced to this form. It is shown that with each test of the above form there is associated an index $\rho$. If $\rho_1$ and $\rho_2$ are the indices corresponding to two alternative tests $e = \log \rho_1/\log \rho_2$ measures the relative efficiency of these tests in the following sense. For large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample of size $en$ with the second test. To obtain the above result, use is made of the fact that $P(S_n \leqq na)$ behaves roughly like $m^n$ where $m$ is the minimum value assumed by the moment generating function of $X - a$. It is shown that if $H_0$ and $H_1$ specify probability distributions of $X$ which are very close to each other, one may approximate $\rho$ by assuming that $X$ is normally distributed.read more
Citations
More filters
Book ChapterDOI
Broadcasting vs. mixing and information dissemination on Cayley graphs
Robert Elsässer,Thomas Sauerwald +1 more
TL;DR: It is proved that the runtime of the algorithm described above is upper bounded by the corresponding mixing time, up to a logarithmic factor.
Journal ArticleDOI
Discrimination Procedures for Separate Families of Hypotheses
TL;DR: In this paper, the authors examined the best invariant procedure for discriminating between models from separate families of hypotheses, with principal emphasis on procedures invariant under location and scale transformations, using Monte Carlo samples as data for five pairs of invariant distributions.
Journal ArticleDOI
Coalescence of low-viscosity fluids in air.
TL;DR: An electrical method is used to study the early stages of coalescence of two low-viscosity drops and the measurements at several drop radii and approach velocities are consistent with a model in which the two liquids coalesce with a slightly deformed interface.
Book ChapterDOI
On the Sample Complexity of Probabilistic Analysis and Design Methods
TL;DR: The role of the binomial distribution is shown for some problems involving analysis and design of robust controllers with finite families and the particular case in which the design problem can be formulated as an uncertain convex optimization problem is addressed.
Journal ArticleDOI
Simplex range reporting on a pointer machine
TL;DR: It is proved that any data structure of that form must occupy storage Ω(n d(1 − δ)− e ) , for any fixed e > 0, and the lower bound is tight within a factor of ne.
References
More filters