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
Proceedings ArticleDOI
P/sup 5/ : a protocol for scalable anonymous communication
TL;DR: A novel feature of P/sup 5/ is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups.
Journal ArticleDOI
Certain results in coding theory for noisy channels
TL;DR: A refinement of the argument based on “random” coding will be used to obtain an upper bound on the probability of error for an optimal code in the memoryless finite discrete channel.
Journal ArticleDOI
On hiding information form an oracle
TL;DR: The framework defined in this paper enables us to prove precise statements about what an encrypted instance hides and what it leaks, in an informationtheoretic sense, as well as describe encryption schemes for some well-known functions.
Journal ArticleDOI
Sleepers and workaholics: caching strategies in mobile environments (extended version)
Daniel Barbará,Tomasz Imielinski +1 more
TL;DR: A taxonomy of different cache invalidation strategies is proposed, and the impact of clients' disconnection times on their performance is studied to improve further the efficiency of the invalidation techniques described.
Journal ArticleDOI
Random Sampling in Cut, Flow, and Network Design Problems
TL;DR: It is shown that the sparse graph, or skeleton, that arises when the authors randomly sample a graph's edges will accurately approximate the value of all cuts in the original graph with high probability, which makes sampling effective for problems involving cuts in graphs.
References
More filters