A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Reads0
Chats0
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
Sleepers and workaholics
BarbaráDaniel,ImielińskiTomasz +1 more
TL;DR: In the mobile wireless computing environment of the future a large number of users equipped with low powered palm-top machines will query databases over the wireless communication channels.
Journal ArticleDOI
Probabilistic polynomials, AC 0 functions and the polynomial-time hierarchy
TL;DR: Every Boolean function in the class AC0 can be computed with one-sided error at most 1/(3nk) by some depth-two probabilistic circuits with a threshold gate at the root, and gates of fan-in logO(1)n at the next level, and (k + 1)log2n + O( 1) random bits.
Journal ArticleDOI
Randomized routing, selection, and sorting on the OTIS-mesh
TL;DR: This paper presents efficient algorithms for packet routing, sorting, and selection on the OTIS-Mesh and reveals that the queue size needed for these algorithms is O(1) with high probability.
Posted Content
Graph Sparsification in the Semi-streaming Model
Kook Jin Ahn,Sudipto Guha +1 more
TL;DR: In this article, it was shown that in the semi-streaming model, where the space is (near) linear in the number of vertices (but not necessarily the edges), and the edges appear in an arbitrary (and possibly adversarial) order, it is possible to approximate the min-cut to a constant factor.
Journal ArticleDOI
Position-Based Quantum Cryptography: Impossibility and Constructions
Harry Buhrman,Nishanth Chandran,Serge Fehr,Ran Gelles,Vipul Goyal,Rafail Ostrovsky,Christian Schaffner +6 more
TL;DR: This work study position-based cryptography in the quantum setting to use the geographical position of a party as its only credential and shows that if adversaries are allowed to share an arbitrarily large entangled quantum state, the task of secure position-verification is impossible.
References
More filters