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
Journal ArticleDOI
Universal Limit Laws for Depths in Random Trees
TL;DR: For random split trees, this work offers a universal law of large numbers and a limit law for the depth of the last inserted point, as well as a law ofLarge numbers for the height.
Journal ArticleDOI
A new technique for analyzing large traffic systems
TL;DR: This paper presents a new technique for analyzing the frequency of a very large class of rare events in large traffic systems based on the theory of large deviations, and obtains estimates of the transient behavior of the system.
Proceedings ArticleDOI
Sampling algorithms: lower bounds and applications
TL;DR: A framework to study probabilistic sampling algorithms that approximate general functions of the form genfunc, where domain and range are arbitrary sets, and two quantitative properties of functions are defined that give techniques to prove lower bounds on the query complexity.
Posted Content
Wireless Device-to-Device Communications with Distributed Caching
TL;DR: It is shown that if the Zipf exponent of the content reuse distribution is greater than 1, it is possible to have a number of D2D interference-free collaboration pairs that scales linearly in the number of nodes.
Journal ArticleDOI
User-friendly tail bounds for sums of random matrices
TL;DR: In this paper, the authors present new probability inequalities for sums of independent, random, self-adjoint matrices, which place simple and easily verifiable hypotheses on the summands, and deliver strong conclusions about the large-deviation behavior of the maximum eigenvalue of the sum.
References
More filters